TU Darmstadt / ULB / TUbiblio

Items in division

Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators | Date | Item Type | Language | No Grouping
Jump to: A | B | C | D | F | G | H | L | M | P | S | W
Number of items at this level (without sub-levels): 64.

A

Altherr, Lena C. ; Leise, Philipp ; Pfetsch, Marc E. ; Schmitt, Andreas (2019):
Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP.
In: Optimization and Engineering, 20 (2), pp. 605-645. Springer US, ISSN 1389-4420,
DOI: 10.1007/s11081-019-09423-8,
[Article]

Abed, F. ; Chen, L. ; Disser, Y. ; Groß, M. ; Megow, N. ; Meißner, J. ; Richter, A. ; Rischke, R. (2017):
Scheduling Maintenance Jobs in Networks.
In: Lecture Notes in Computer Science, 10236, In: CIAC 2017: Algorithms and Complexity, pp. 19-30,
Springer, 10th International Conference on Algorithms and Complexity, Athens, Greece, 24.-26.05.2017, ISBN 978-3-319-57585-8,
DOI: 10.1007/978-3-319-57586-5_3,
[Conference or Workshop Item]

B

Birx, Alexander (2020):
Competitive analysis of the online dial-a-ride problem.
Darmstadt, Technische Universität,
DOI: 10.25534/tuprints-00014134,
[Ph.D. Thesis]

Birx, Alexander ; Disser, Yann (2020):
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
In: SIAM Journal on Discrete Mathematics, 34 (2), pp. 1409-1443. Society for Industrial and Applied Mathematics, ISSN 0895-4801,
DOI: 10.1137/19M1268513,
[Article]

Bärtschi, Andreas ; Chalopin, Jeremie ; Das, Shantanu ; Disser, Yann ; Geissmann, Barbara ; Graf, Daniel ; Labourel, Arnaud ; Mihalák, Matus (2020):
Collaborative Delivery with Energy-Constrained Mobile Robots.
In: Theoretical Computer Science, 810, pp. 2-14. Elsevier, ISSN 0304-3975,
DOI: 10.1016/j.tcs.2017.04.018,
[Article]

Burggraf, Timo ; Joswig, Michael ; Pfetsch, Marc E. ; Ulbrich, Stefan (2020):
Semi-automatically optimized calibration of internal combustion engines.
In: Optimization and Engineering, 21 (1), pp. 73-106. Springer, ISSN 1389-4420,
DOI: 10.1007/s11081-019-09434-5,
[Article]

Birx, Alexander ; Disser, Yann ; Schewior, Kevin
Achlioptas, Dimitris ; Végh‬, ‪László (eds.) (2019):
Improved Bounds for Open Online Dial-a-Ride on the Line.
In: Leibniz International Proceedings in Informatics, 145, In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2019), Cambridge, USA, 20.-22.09.2019, ISSN 1868-8969, ISBN 978-3-95977-125-2,
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2019.21,
[Conference or Workshop Item]

Birx, Alexander ; Disser, Yann
Niedermeier, Rolf ; Paul, Christophe (eds.) (2019):
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
In: Leibniz International Proceedings in Informatics, 126, In: Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science,
Dagstuhl Publishing, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Berlin, Germany, 13.-16.03.2020, ISBN 978-3-95977-100-9,
DOI: 10.4230/LIPIcs.STACS.2019.15,
[Conference or Workshop Item]

Bernstein, Aaron ; Disser, Yann ; Groß, Martin (2017):
General Bounds for Incremental Maximization.
In: Leibniz International Proceedings in Informatics, 80, In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP),
Dagstuhl Publishing, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Warsaw, Poland, 10.-14.07.2017, ISBN 978-3-95977-041-5,
DOI: 10.4230/LIPIcs.ICALP.2017.43,
[Conference or Workshop Item]

Bjelde, Antje ; Disser, Yann ; Hackfeld, Jan ; Hansknecht, Christoph ; Lipmann, Maarten ; Meißner, Julie ; Schewior, Kevin ; Schlöter, Miriam ; Stougie, Leen (2017):
Tight bounds for online TSP on the line.
In: Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 994-1005,
SIAM, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 16.-19.01.2017, ISBN 978-1-61197-478-2,
DOI: 10.1137/1.9781611974782.63,
[Conference or Workshop Item]

Bärtschi, A. ; Chalopin, J. ; Das, S. ; Disser, Y. ; Graf, D. ; Hackfeld, J. ; Penna, P. (2017):
Energy-efficient Delivery by Heterogenous Mobile Agents.
Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS), [Conference or Workshop Item]

Bärtschi, Andreas ; Chalopin, Jeremie ; Das, Shantanu ; Disser, Yann ; Geissmann, Barbara ; Graf, Daniel ; Labourel, Arnaud ; Mihalák, Matus (2016):
Collaborative Delivery with Energy-Constrained Mobile Robots.
In: Lecture Notes in Computer Science, 9988, In: Structural Information and Communication Complexity, pp. 258-274,
Springer, 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), Helsinki, Finnland, 19.-21.07.2016, ISBN 978-3-319-48313-9,
DOI: 10.1007/978-3-319-48314-6_17,
[Conference or Workshop Item]

Böhmová, K. ; Disser, Y. ; Mihalák, M. ; Sramek, R. (2016):
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.
pp. 220–234, Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN), [Conference or Workshop Item]

Böhmová, K. ; Disser, Y. ; Kravina, E. ; Mihalák, M. ; Widmayer, P. (2015):
Interval Selection on Unrelated Machines.
Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), [Conference or Workshop Item]

Böhmová, K. ; Disser, Y. ; Widmayer, P. ; Mihalák, M. (2013):
Interval Selection with Machine-Dependent Intervals.
pp. 170-181, Proceedings of the 13th International Algorithms and Data Structures Symposium (WADS), [Conference or Workshop Item]

Bilò, D. ; Disser, Y. ; Gualà, L. ; Mihalák, M. ; Proietti, G. ; Widmayer, P. (2013):
Polygon-Constrained Motion Planning Problems.
pp. 67-82, Proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), [Conference or Workshop Item]

Bilò, D. ; Disser, Y. ; Mihalák, M. ; Vicari, E. ; Suri, S. ; Widmayer, P. (2012):
Reconstructing Visibility Graphs with Simple Robots.
In: Theoretical Computer Science, 444, pp. 52-59. [Article]

Bilò, D. ; Disser, Y. ; Mihalák, M. ; Suri, S. ; Vicari, E. ; Widmayer, P. (2009):
Reconstructing Visibility Graphs with Simple Robots.
pp. 87-99, Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), [Conference or Workshop Item]

C

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2015):
Mapping simple polygons: The power of telling convex from reflex.
In: ACM Transactions on Algorithms, 11, pp. 33(16). [Article]

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2013):
Mapping Simple Polygons: How Robots Benefit from Looking Back.
In: Algorithmica, 65, pp. 43-59. [Article]

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2013):
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons.
In: Discrete Applied Mathematics, 161, pp. 1287-1307. [Article]

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2011):
Telling convex from reflex allows to map a polygon.
pp. 153-164, Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), [Conference or Workshop Item]

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2010):
How Simple Robots Benefit from Looking Back.
pp. 229-239, Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC), [Conference or Workshop Item]

D

Disser, Y. ; Hopp, A. V.
Lodi, A. ; Nagarajan, V. (eds.) (2019):
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.
In: Lecture Notes in Computer Science, 11480, In: Integer Programming and Combinatorial Optimization, pp. 168-180,
Springer, 20th Interantional Conference on Integer Programming and Combinatorial Optimization (IPCO 2019), Ann Arbor, USA, 22.-24.05.2019, ISBN 978-3-030-17953-3,
DOI: 10.1007/978-3-030-17953-3_13,
[Conference or Workshop Item]

Disser, Yann ; Hopp, Alexander V. (2018):
On Friedmann's subexponential lower bound for Zadeh's pivot rule.
2. revised version, Darmstadt, [Report]

Disser, Yann ; Mousset, Frank ; Noever, Andreas ; Škorić, Nemanja ; Steger, Angelika (2017):
A general lower bound for collaborative tree exploration.
In: Lecture Notes in Computer Science, 10641, In: Structural Information and Communication Complexity, pp. 125-139,
Springer, 24th International Colloquium on Structural Information and Communication Complexity, Porquerolles, France, 19.-22.06.2017, ISBN 978-3-319-72049-4,
DOI: 10.1007/978-3-319-72050-0_8,
[Conference or Workshop Item]

Disser, Y. ; Kratsch, S. (2017):
Robust and adaptive search.
Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS), [Conference or Workshop Item]

Disser, Y. ; Klimm, M. ; Megow, N. ; Stiller, S. (2017):
Packing a knapsack of unknown capacity.
In: SIAM Journal on Discrete Mathematics, 31 (3), pp. 1477-1497. [Article]

Disser, Y. ; Skiena, S. S.
Goodman, J. E. ; O'Rourke, J. ; Tóth, C. D. (eds.) (2016):
Geometric Reconstruction Problems.
In: Handbook of Discrete and Computational Geometry, CRC Press LLC, [Book Section]

Disser, Y. ; Matuschke, J. (2016):
Degree-constrained orientations of embedded graphs.
In: Journal of Combinatorial Optimization, 3, pp. 758-773. [Article]

Disser, Y. ; Hackfeld, J. ; Klimm, M. (2016):
Undirected Graph Exploration with Θ(log log n) Pebbles.
pp. 25-39, Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), [Conference or Workshop Item]

Disser, Y. ; Feldmann, A. ; Klimm, M. ; Mihalák, M. (2015):
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games.
In: Theoretical Computer Science, 562, pp. 557-564. [Article]

Dereniowski, D. ; Disser, Y. ; Kosowski, A. ; Pająk, D. ; Uznański, P. (2015):
Fast Collaborative Graph Exploration.
In: Information and Computation, 243, pp. 37-49. [Article]

Disser, Y. ; Skutella, M. (2015):
The Simplex Algorithm is NP-mighty.
In: Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 858-872,
SIAM, 26th ACM-SIAM Symposium on Discrete Algorithms, San Diego, USA, 04.-06.01.2015, ISBN 978-1-61197-374-7,
DOI: 10.1137/1.9781611973730.59,
[Conference or Workshop Item]

Disser, Y. ; Klimm, M. ; Lübbecke, E. (2015):
Scheduling Bidirectional Traffic on a Path.
pp. 406–418, Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP), [Conference or Workshop Item]

Disser, Y. ; Mihalák, M. ; Montanari, S. (2015):
Max Shortest Path for Imprecise Points.
Proceedings of the 30th European Workshop on Computational Geometry (EuroCG), [Conference or Workshop Item]

Disser, Y. ; Ghosh, S. K. ; Mihalák, M. ; Widmayer, P. (2014):
Mapping a polygon with holes using a compass.
In: Theoretical Computer Science, 553, pp. 106-113. [Article]

Disser, Y. ; Megow, N. ; Klimm, M. ; Stiller, S. (2014):
Packing a Knapsack of Unknown Capacity.
pp. 276-287, Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), [Conference or Workshop Item]

Disser, Y. ; Mihalák, M. ; Montanari, S. ; Widmayer, P. (2014):
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.
pp. 208-220, Proceedings of the International Symposium on Combinatorial Optimization (ISCO), [Conference or Workshop Item]

Disser, Y. ; Kratsch, S. ; Sorge, M. (2014):
The Minimum Feasible Tileset Problem.
In: Lecture Notes in Computer Science, 8952, In: Approximation and Online Algorithms, pp. 144-155,
Springer, 12th Workshop on Approximation and Online Algorithms (WAOA 2014), Wrolaw, Poland, 11.-12.09.2014, ISBN 978-3-319-18262-9,
DOI: 10.1007/978-3-319-18263-6_13,
[Conference or Workshop Item]

Disser, Y. ; Feldmann, A. ; Klimm, M. ; Mihalák, M. (2013):
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games.
pp. 158-169, Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC), [Conference or Workshop Item]

Dereniowski, D. ; Disser, Y. ; Kosowski, A. ; Pająk, D. ; Uznański, P. (2013):
Fast Collaborative Graph Exploration.
p. 520, Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), [Conference or Workshop Item]

Disser, Y. ; Ghosh, S. K. ; Mihalák, M. ; Widmayer, P. (2012):
Mapping a polygon with holes using a compass.
pp. 78-89, Proceedings of the 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), [Conference or Workshop Item]

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2012):
Mapping polygons with agents that measure angles.
pp. 415-425, Proceedings of the 10th International Workshop on the Algorithmic Foundations of Robotics (WAFR), [Conference or Workshop Item]

Disser, Y. ; Matuschke, J. (2012):
Degree-constrained orientations of embedded graphs.
pp. 506-516, Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC), [Conference or Workshop Item]

Disser, Y. (2011):
Mapping Polygons.
Logos Berlin, ETH Zurich,
[Ph.D. Thesis]

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2011):
A polygon is determined by its angles.
In: Computational Geometry: Theory and Applications, 44, pp. 418-426. [Article]

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2010):
Reconstructing a simple polygon from its angles.
pp. 13-24, Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), [Conference or Workshop Item]

Domschke, Pia ; Geissler, Björn ; Kolb, Oliver ; Lang, Jens ; Martin, Alexander ; Morsi, Antonio (2010):
Combination of Nonlinear and Linear Optimization of Transient Gas Networks.
In: INFORMS Journal on Computing, ISSN 1091-9856,
DOI: 10.1287/ijoc.1100.0429,
[Article]

Disser, Y. ; Bilò, D. ; Mihalák, M. ; Suri, S. ; Vicari, E. ; Widmayer, P. (2009):
On the Limitations of Combinatorial Visibilities.
pp. 207-210, Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), [Conference or Workshop Item]

Disser, Y. ; Müller-Hannemann, M. ; Schnee, M. (2008):
Multi-criteria Shortest Paths in Time-Dependent Train Networks.
pp. 347 - 361, Proceedings of the 7th International Workshop on Experimental Algorithms (WEA), [Conference or Workshop Item]

F

Fischer, Tobias ; Pfetsch, Marc E. (2018):
Branch-and-cut for linear programs with overlapping SOS1 constraints.
In: Mathematical Programming Computation, 10 (1), pp. 33-68. ISSN 1867-2957,
DOI: 10.1007/s12532-017-0122-5,
[Article]

G

Gally, Tristan ; Groche, Peter ; Hoppe, Florian ; Kuttich, Anja ; Matei, Alexander ; Pfetsch, Marc E. ; Rakowitsch, Martin ; Ulbrich, Stefan (2021):
Identification of model uncertainty via optimal design of experiments applied to a mechanical press.
In: Optimization and Engineering, Springer Nature, ISSN 1389-4420,
DOI: 10.1007/s11081-021-09600-8,
[Article]

Gleixner, Ambros M. ; Bastubbe, Michael ; Eifler, Leon ; Gally, Tristan ; Gamrath, Gerald ; Gottwald, Robert L. ; Hendel, Gregor ; Hojny, Christoper ; Koch, Thorsten ; Lübbecke, Marco E. ; Maher, Stephen J. ; Miltenberger, Matthias ; Müller, Benjamin ; Pfetsch, Marc E. ; Puchert, Christian ; Rehfeldt, Daniel ; Schlösser, Franziska ; Schubert, Christoph ; Serrano, Felipe ; Shinano, Yuji ; Viernickel, Jan Merlin ; Walter, Matthias ; Wegscheider, Fabian ; Witt, Jonas T. ; Witzig, Jakob (2018):
The SCIP Optimization Suite 6.0.
In: ZIB-Report, 18, (26), Berlin, Zuse Institute Berlin, ISSN 1438-0064,
[Report]

H

Huang, Wei (2019):
Optimal Operation of Water Supply Networks by Mixed Integer Nonlinear Programming and Algebraic Methods.
Darmstadt, tuprints, Technische Universität,
[Ph.D. Thesis]

Hojny, Christopher (2018):
Symmetries in binary program : A polyhedaral perspective.
Göttingen, sierke Verlag, TU Darmstadt, ISBN 9783965480001,
[Ph.D. Thesis]

Hojny, Christoper ; Pfetsch, Marc E. ; Schmitt, Andreas (2017):
Extended Formulations for Column Constrained Orbitopes.
In: Operations Research Proceedings 2017 : Selected Papers of the Annual International Conference of the German Operations Research Society, pp. 197-203,
Springer, International Conference of the German Operations Research Society, Berlin, Germany, 06.-08.09.2017, ISBN 978-3-319-89920-6,
[Conference or Workshop Item]

L

Lüthen, Hendrik (2019):
Partitioning into Isomorphic or Connected Subgraphs.
Darmstadt, Technische Universität,
[Ph.D. Thesis]

M

Maher, Stephen J. ; Fischer, Tobias ; Gally, Tristan ; Gamrath, Gerald ; Gleixner, Ambros M. ; Gottwald, Robert L. ; Hendel, Gregor ; Koch, Thorsten ; Lübbecke, Marco E. ; Miltenberger, Matthias ; Müller, Benjamin ; Pfetsch, Marc E. ; Puchert, Christian ; Rehfeldt, Daniel ; Schenker, Sebastian ; Schwarz, Robert ; Serrano, Felipe ; Shinano, Yuji ; Weninger, Dieter ; Witt, Jonas T. ; Witzig, Jakob (2017):
The SCIP Optimization Suite 4.0.
In: ZIB-Report, 17, (12), [Report]

P

Pfetsch, Marc E. ; Schmitt, Andreas
Neufeld, Janis S. ; Buscher, Udo ; Lasch, Rainer ; Möst, Jörn (eds.) (2020):
Exploiting Partial Convexity of Pump Characteristics in Water Network Design.
In: Operations Research Proceedings, In: Operations Research Proceedings 2019: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), pp. 497-503,
Springer, Annual International Conference of the German Operations Research Society (GOR 2019), Dresden, Germany, 04.-06.09.2019, ISBN 978-3-030-48438-5,
DOI: 10.1007/978-3-030-48439-2_60,
[Conference or Workshop Item]

Paffenholz, Andreas (2015):
Faces of Birkhoff Polytopes.
In: Electronic Journal of Combinatorics, 22 (1), ISSN 1077-8926,
[Article]

Paffenholz, Andreas ; Ziegler, Günter M. (2004):
The E_t-construction for lattices, spheres and polytopes.
In: Discrete Comput. Geom., 32 (4), pp. 601-621. ISSN 0179-5376,
DOI: 10.1007/s00454-004-1140-4,
[Article]

S

Shinano, Yuji ; Rehfeldt, Daniel ; Gally, Tristan (2019):
An Easy Way to Build Parallel State-of-the-art Combinatorial Optimization Problem Solvers: A Computational Study on Solving Steiner Tree Problems and Mixed Integer Semidefinite Programs by using ug{SCIP}-*,*-libraries.
In: 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 530-541,
Piscataway, N.J., IEEE, 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Rio de Janeiro, Brazil, 20.-24.5.2019, ISBN 9781728135106,
[Conference or Workshop Item]

W

Wilms, J. ; Disser, Y. ; Alber, G. ; Percival, I. C. (2008):
Local Realism, Detection Efficiencies, and Probability Polytopes.
In: Physical Review A, 78 (3), APS Physics, ISSN 2469-9926,
DOI: 10.1103/PhysRevA.78.032116,
[Article]

This list was generated on Sun Sep 25 00:57:47 2022 CEST.