default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel R. Schmidt
Person information
- affiliation: University of Cologne, Computer Science Department
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Nathan Nakamura
, Paul Szypryt, Amber L. Dagel, Bradley K. Alpert, Douglas A. Bennett, William Bertrand Doriese, Malcolm Durkin, Joseph W. Fowler, Dylan T. Fox, Johnathon D. Gard, Ryan N. Goodner, James Zachariah Harris, Gene C. Hilton, Edward S. Jimenez, Burke L. Kernen, Kurt W. Larson, Zachary H. Levine, Daniel McArthur, Kelsey M. Morgan, Galen C. O'Neil, Nathan J. Ortiz, Christine G. Pappas, Carl D. Reintsema, Daniel R. Schmidt, Peter A. Schultz, Kyle R. Thompson, Joel N. Ullom, Leila Vale, Courtenay T. Vaughan, Christopher Walker, Joel C. Weber, Jason W. Wheeler, Daniel S. Swetz:
Nanoscale Three-Dimensional Imaging of Integrated Circuits Using a Scanning Electron Microscope and Transition-Edge Sensor Spectrometer. Sensors 24(9): 2890 (2024)- [c7]Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt:
Local Search k-means++ with Foresight. SEA 2024: 7:1-7:20 - [i6]Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt:
Local Search k-means++ with Foresight. CoRR abs/2406.02739 (2024) - 2022
- [j8]David Könen, Daniel R. Schmidt, Christiane Spisla:
Finding all minimum cost flows and a faster algorithm for the K best flow problem. Discret. Appl. Math. 321: 333-349 (2022) - 2021
- [j7]Daniela Gaul, Daniel R. Schmidt:
Chvátal-Gomory cuts for the Steiner tree problem. Discret. Appl. Math. 291: 188-200 (2021) - [j6]Daniel R. Schmidt, Bernd Zey, François Margot:
Stronger MIP formulations for the Steiner forest problem. Math. Program. 186(1): 373-407 (2021) - [j5]Daniel R. Schmidt, Bernd Zey, François Margot:
Correction to: Stronger MIP formulations for the Steiner forest problem. Math. Program. 188(1): 409-410 (2021) - [i5]David Könen, Daniel R. Schmidt, Christiane Spisla:
Finding all minimum cost flows and a faster algorithm for the K best flow problem. CoRR abs/2105.10225 (2021) - 2020
- [j4]Chrysanthos E. Gounaris, Daniel R. Schmidt:
Generalized Hose uncertainty in single-commodity robust network design. Optim. Lett. 14(4): 925-944 (2020)
2010 – 2019
- 2019
- [c6]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the Cost of Essentially Fair Clusterings. APPROX-RANDOM 2019: 18:1-18:22 - 2018
- [c5]Daniel R. Schmidt, Bernd Zey, François Margot:
An Exact Algorithm for the Steiner Forest Problem. ESA 2018: 70:1-70:14 - [c4]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. ITCS 2018: 31:1-31:17 - [i4]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the cost of essentially fair clusterings. CoRR abs/1811.10319 (2018) - 2017
- [i3]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. CoRR abs/1707.02753 (2017) - [i2]Daniel R. Schmidt, Bernd Zey, François Margot:
MIP Formulations for the Steiner Forest Problem. CoRR abs/1709.01124 (2017) - 2016
- [j3]Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt:
Single-commodity robust network design with finite and Hose demand sets. Math. Program. 157(1): 297-342 (2016) - 2015
- [c3]Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Solving k-means on High-Dimensional Big Data. SEA 2015: 259-270 - [i1]Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Solving k-means on High-dimensional Big Data. CoRR abs/1502.04265 (2015) - 2014
- [b1]Daniel R. Schmidt:
Robust Design of Single-Commodity Networks. University of Cologne, Germany, 2014 - [j2]Eduardo Álvarez-Miranda, Valentina Cacchiani, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Single-commodity robust network design problem: Complexity, instances and heuristic solutions. Eur. J. Oper. Res. 238(3): 711-723 (2014) - 2012
- [c2]Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt:
Approximating Earliest Arrival Flows in Arbitrary Networks. ESA 2012: 551-562 - [c1]Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO 2012: 261-272
2000 – 2009
- 2009
- [j1]Martin Groß, Daniel Plümpe, Melanie Schmidt:
Kreuzzahlrätsel: Sudokus waren gestern. Inform. Spektrum 32(6): 538-545 (2009)
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-07-15 01:04 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:
