default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Jacobs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Luis Roda-Sanchez
, Flavio Cirillo, Gürkan Solmaz, Tobias Jacobs, Celia Garrido-Hidalgo, Teresa Olivares, Ernö Kovacs:
Building a Smart Campus Digital Twin: System, Analytics, and Lessons Learned From a Real-World Project. IEEE Internet Things J. 11(3): 4614-4627 (2024)- [i10]Bin Cheng, Jonathan Fürst, Tobias Jacobs, Celia Garrido-Hidalgo:
Interactive Ontology Matching with Cost-Efficient Learning. CoRR abs/2404.07663 (2024) - 2022
- [c18]Gürkan Solmaz, Flavio Cirillo, Jonathan Fürst, Tobias Jacobs, Martin Bauer, Ernö Kovacs, Juan Ramón Santana, Luis Sánchez:
Enabling data spaces: existing developments and challenges. DE@CoNEXT 2022: 42-48 - [c17]Tobias Jacobs, Jingyi Yu, Julia Gastinger, Timo Sztyler:
ProcK: Machine Learning for Knowledge-Intensive Processes. ECML/PKDD (2) 2022: 107-121 - 2021
- [c16]Tobias Jacobs, Francesco Alesiani, Gülcin Ermis:
Reinforcement Learning for Route Optimization with Robustness Guarantees. IJCAI 2021: 2592-2598 - [i9]Laura Coconea, Miha Cimperman, Tobias Jacobs:
ITS and Real Time Cross Border Logistic Operations Optimization. CoRR abs/2101.03803 (2021) - [i8]Tobias Jacobs, Jingyi Yu, Julia Gastinger, Timo Sztyler:
ProcK: Machine Learning for Knowledge-Intensive Processes. CoRR abs/2109.04881 (2021) - 2020
- [i7]Luka Stopar, Luka Bradesko, Tobias Jacobs, Azur Kurbasic, Miha Cimperman:
Large-Scale Cargo Distribution. CoRR abs/2009.14187 (2020) - [i6]Tobias Jacobs, Mischa Schmidt, Sebastien Nicolas, Anett Schülke:
The Combinatorial Multi-Bandit Problem and its Application to Energy Management. CoRR abs/2010.16269 (2020)
2010 – 2019
- 2019
- [c15]Mischa Schmidt, Shahd Safarani, Julia Gastinger, Tobias Jacobs, Sebastien Nicolas, Anett Schülke:
On the Performance of Differential Evolution for Hyperparameter Tuning. IJCNN 2019: 1-8 - [i5]Mischa Schmidt, Shahd Safarani, Julia Gastinger, Tobias Jacobs, Sebastien Nicolas, Anett Schülke:
On the Performance of Differential Evolution for Hyperparameter Tuning. CoRR abs/1904.06960 (2019) - [i4]Prabhant Singh, Tobias Jacobs, Sebastien Nicolas, Mischa Schmidt:
A Study of the Learning Progress in Neural Architecture Search Techniques. CoRR abs/1906.07590 (2019) - 2017
- [j12]Giuseppe Siracusano, Roberto Bifulco, Martino Trevisan, Tobias Jacobs, Simon Kuenzer, Stefano Salsano, Nicola Blefari-Melazzi, Felipe Huici:
Re-Designing Dynamic Content Delivery in the Light of a Virtualized Infrastructure. IEEE J. Sel. Areas Commun. 35(11): 2574-2585 (2017) - [c14]Tobias Jacobs, Sebastien Nicolas, Tae-Gil Noh, Anett Schuelke, Hans Auer, Daniel Schwabeneder, Daniele Basciotti, Edmund Widl, Sawsan Henein, Olatz Terreros:
A holistic study of energy network hybridization in a Northern European City. ISGT Europe 2017: 1-6 - [i3]Giuseppe Siracusano, Roberto Bifulco, Martino Trevisan, Tobias Jacobs, Simon Kuenzer, Stefano Salsano, Nicola Blefari-Melazzi, Felipe Huici:
Re-designing Dynamic Content Delivery in the Light of a Virtualized Infrastructure. CoRR abs/1709.04437 (2017) - 2016
- [c13]Tobias Jacobs, Sebastien Nicolas, Tae-Gil Noh, Anett Schuelke, Hans Auer, Daniel Schwabeneder, Daniele Basciotti, Edmund Widl, Sawsan Henein, Olatz Terreros:
Increasing the Utilization Ratio of Photovoltaic Energy by Network Hybridization. BDCloud-SocialCom-SustainCom 2016: 445-452 - 2015
- [j11]Wiebke Höhn, Tobias Jacobs:
On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost. ACM Trans. Algorithms 11(4): 25:1-25:30 (2015) - [c12]Tobias Jacobs, Salvatore Longo:
A Study of Caching Strategies for Web Service Discovery. ICWS 2015: 464-471 - 2014
- [j10]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Algorithmica 68(4): 1045-1074 (2014) - [j9]Hiroshi Fujiwara, Tobias Jacobs:
On the Huffman and Alphabetic Tree Problem with General Cost Functions. Algorithmica 69(3): 582-604 (2014) - [c11]Flavio Cirillo, Tobias Jacobs:
Link discovery in social networks. ASONAM 2014: 898-905 - [i2]Tobias Jacobs, Salvatore Longo:
A New Perspective on the Windows Scheduling Problem. CoRR abs/1410.7237 (2014) - 2012
- [j8]Tobias Jacobs:
On the Complexity of Optimal Hotlink Assignment. Algorithmica 62(3-4): 982-1005 (2012) - [j7]Wiebke Höhn, Tobias Jacobs, Nicole Megow:
On Eulerian extensions and their application to no-wait flowshop scheduling. J. Sched. 15(3): 295-309 (2012) - [j6]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim:
The binary identification problem for weighted trees. Theor. Comput. Sci. 459: 100-112 (2012) - [j5]Tobias Jacobs:
Analytical aspects of tie breaking. Theor. Comput. Sci. 465: 1-9 (2012) - [c10]Wiebke Höhn, Tobias Jacobs:
An Experimental and Analytical Study of Order Constraints for Single Machine Scheduling with Quadratic Cost. ALENEX 2012: 103-117 - [c9]Wiebke Höhn, Tobias Jacobs:
On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost. LATIN 2012: 482-493 - 2011
- [j4]Tobias Jacobs:
Constant factor approximations for the hotlink assignment problem. ACM Trans. Algorithms 7(2): 16:1-16:19 (2011) - [j3]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. 412(50): 6879-6896 (2011) - [c8]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim:
Binary Identification Problems for Weighted Trees. WADS 2011: 255-266 - 2010
- [j2]Susanne Albers, Tobias Jacobs:
An Experimental Study of New and Known Online Packet Buffering Algorithms. Algorithmica 57(4): 725-746 (2010) - [j1]Tobias Jacobs:
An experimental study of recent hotlink assignment algorithms. ACM J. Exp. Algorithmics 15 (2010) - [c7]Hiroshi Fujiwara, Tobias Jacobs:
On the Huffman and Alphabetic Tree Problem with General Cost Functions. ESA (1) 2010: 439-450 - [c6]Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) 2010: 527-539 - [c5]Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro:
On Greedy Algorithms for Decision Trees. ISAAC (2) 2010: 206-217
2000 – 2009
- 2009
- [b1]Tobias Jacobs:
Hotlink Assignment. University of Freiburg, Germany, 2009 - [i1]Tobias Jacobs:
Resistant Algorithms: Obtaining Simpler Proofs by Excluding Corner Cases. CoRR abs/0910.1387 (2009) - 2008
- [c4]Tobias Jacobs:
An Experimental Study of Recent Hotlink Assignment Algorithms. ALENEX 2008: 142-151 - [c3]Tobias Jacobs:
On the Complexity of Optimal Hotlink Assignment. ESA 2008: 540-552 - 2007
- [c2]Susanne Albers, Tobias Jacobs:
An Experimental Study of New and Known Online Packet Buffering Algorithms. ESA 2007: 754-765 - [c1]Tobias Jacobs:
Constant Factor Approximations for the Hotlink Assignment Problem. WADS 2007: 188-200
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
