default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDirk Müller 0003
Person information
- affiliation: University of Bonn, Research Institute for Discrete Mathematics, Bonn, Germany
Other persons with the same name
- Dirk Müller (aka: Dirk Mueller) — disambiguation page
- Dirk Müller 0001 — Philips GmbH Healthcare - Imaging Systems, Hamburg, Germany (and 1 more)
- Dirk Müller 0002 — Hochschule für Technik und Wirtschaft Dresden, Germany (and 1 more)
- Dirk Müller 0004 — Insilico Biotechnology AG, Stuttgart, Germany
- Dirk Müller 0005
![[0000-0002-6106-6607]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-6106-6607")
— RWTH Aachen University, Institute for Energy Efficient Buildings and Indoor Climate, Germany - Dirk Müller 0006 — University of Siegen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b1]Dirk Müller:
Fast Resource Sharing in VLSI Routing. University of Bonn, Germany, 2010
Journal Articles
- 2024
- [j6]Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen:
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks. Discret. Optim. 53: 100848 (2024) - 2018
- [j5]Stephan Held, Dirk Müller, Daniel Rotter, Rudolf Scheifele, Vera Traub, Jens Vygen:
Global Routing With Timing Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(2): 406-419 (2018) - 2015
- [j4]Markus Ahrens, Michael Gester, Niko Klewinghaus, Dirk Müller, Sven Peyer, Christian Schulte, Gustavo E. Téllez:
Detailed Routing Algorithms for Advanced Technology Nodes. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 34(4): 563-576 (2015) - 2013
- [j3]Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen:
BonnRoute: Algorithms and data structures for fast and good VLSI routing. ACM Trans. Design Autom. Electr. Syst. 18(2): 32:1-32:24 (2013) - 2011
- [j2]Dirk Müller, Klaus Radke, Jens Vygen:
Faster min-max resource sharing in theory and practice. Math. Program. Comput. 3(1): 1-35 (2011) - 2006
- [j1]Dirk Müller:
On the complexity of the planar directed edge-disjoint paths problem. Math. Program. 105(2-3): 275-288 (2006)
Conference and Workshop Papers
- 2015
- [c4]Stephan Held, Dirk Müller, Daniel Rotter, Vera Traub, Jens Vygen:
Global Routing with Inherent Static Timing Constraints. ICCAD 2015: 102-109 - 2012
- [c3]Michael Gester, Dirk Müller, Tim Nieberg, Christian Panten, Christian Schulte, Jens Vygen:
Algorithms and data structures for fast and good VLSI routing. DAC 2012: 459-464 - 2006
- [c2]Dirk Müller:
Optimizing yield in global routing. ICCAD 2006: 480-486 - [c1]Jeanne Bickford, Jason Hibbeler, Markus Bühler, Jürgen Koehl, Dirk Müller, Sven Peyer, Christian Schulte:
Yield Improvement by Local Wiring Redundancy. ISQED 2006: 473-478
Informal and Other Publications
- 2022
- [i1]Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens Vygen:
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks. CoRR abs/2205.00889 (2022)
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-11-28 21:25 CET 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:
