Englisch

Liu, Tianyi ; Matter, Frederic ; Sorg, Alexander ; Pfetsch, Marc E. ; Haardt, Martin ; Pesavento, Marius (2024)
Maximum A Posteriori Direction-of-Arrival Estimation via Mixed-Integer Semidefinite Programming.
doi: 10.48550/arXiv.2311.03501
Report, Bibliographie

Liu, Tianyi ; Deram, Sai Pavan ; Ardah, Khaled ; Haardt, Martin ; Pfetsch, Marc E. ; Pesavento, Marius (2024)
Gridless Parameter Estimation in Partly Calibrated Rectangular Arrays.
doi: 10.48550/arXiv.2406.16041
Report, Bibliographie

Liu, Tianyi ; Deram, Sai Pavan ; Ardah, Khaled ; Haardt, Martin ; Pfetsch, Marc E. ; Pesavento, Marius (2024)
Gridless Parameter Estimation in Partly Calibrated Rectangular Arrays.
49th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2024). Seoul, Republic of Korea (14.-19.04.2024)
doi: 10.1109/ICASSP48485.2024.10446959
Konferenzveröffentlichung, Bibliographie

Weckbecker, David Michael (2024)
Competitive Analysis for Incremental Maximization.
Technische Universität Darmstadt
doi: 10.26083/tuprints-00026447
Dissertation, Erstveröffentlichung, Verlagsversion

Liu, Tianyi ; Matter, Frederic ; Sorg, Alexander ; Pfetsch, Marc E. ; Haardt, Martin ; Pesavento, Marius (2023)
Joint Sparse Estimation with Cardinality Constraint via Mixed-Integer Semidefinite Programming.
9th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing. Herradura, Costa Rica (10.-13.12.2023)
doi: 10.1109/CAMSAP58249.2023.10403415
Konferenzveröffentlichung, Bibliographie

Ardah, Khaled ; Haardt, Martin ; Liu, Tianyi ; Matter, Frederic ; Pesavento, Marius ; Pfetsch, Marc E.
Hrsg.: Kutyniok, Gitta ; Rauhut, Holger ; Kunsch, Robert J. (2022)
Recovery Under Side Constraints.
In: Compressed Sensing in Information Processing, Auflage: 1. Auflage
doi: 10.1007/978-3-031-09745-4_7
Buchkapitel, Bibliographie

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, 23 (1)
doi: 10.1007/s11081-021-09600-8
Artikel, Bibliographie

Hrsg.: Pelz, Peter F. ; Groche, Peter (2021)
Uncertainty in Mechanical Engineering : Proceedings of the 4th International Conference on Uncertainty in Mechanical Engineering (ICUME 2021), June 7–8, 2021.
International Conference on Uncertainty in Mechanical Engineering (ICUME 2021). (07.-08.06.2021)
doi: 10.1007/978-3-030-77256-7
Konferenzveröffentlichung, Bibliographie

Pfetsch, Marc E. ; Schmitt, Andreas
Hrsg.: Neufeld, Janis S. ; Buscher, Udo ; Lasch, Rainer ; Möst, Jörn (2020)
Exploiting Partial Convexity of Pump Characteristics in Water Network Design.
Annual International Conference of the German Operations Research Society (GOR 2019). Dresden, Germany (04.09.2019-06.09.2019)
doi: 10.1007/978-3-030-48439-2_60
Konferenzveröffentlichung, Bibliographie

Birx, Alexander (2020)
Competitive analysis of the online dial-a-ride problem.
Technische Universität Darmstadt
doi: 10.25534/tuprints-00014134
Dissertation, Erstveröffentlichung

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)
doi: 10.1137/19M1268513
Artikel, Bibliographie

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
doi: 10.1016/j.tcs.2017.04.018
Artikel, Bibliographie

Burggraf, Timo ; Joswig, Michael ; Pfetsch, Marc E. ; Ulbrich, Stefan (2020)
Semi-automatically optimized calibration of internal combustion engines.
In: Optimization and Engineering, 21 (1)
doi: 10.1007/s11081-019-09434-5
Artikel, Bibliographie

Birx, Alexander ; Disser, Yann ; Schewior, Kevin
Hrsg.: Achlioptas, Dimitris ; Végh‬, ‪László (2019)
Improved Bounds for Open Online Dial-a-Ride on the Line.
22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2019). Cambridge, USA (20.09.2019-22.09.2019)
doi: 10.4230/LIPIcs.APPROX-RANDOM.2019.21
Konferenzveröffentlichung, Bibliographie

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)
doi: 10.1007/s11081-019-09423-8
Artikel, Bibliographie

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.
2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). Rio de Janeiro, Brazil (20.05.2019-24.05.2019)
Konferenzveröffentlichung, Bibliographie

Birx, Alexander ; Disser, Yann
Hrsg.: Niedermeier, Rolf ; Paul, Christophe (2019)
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Berlin, Germany (13.03.2020-16.03.2020)
doi: 10.4230/LIPIcs.STACS.2019.15
Konferenzveröffentlichung, Bibliographie

Lüthen, Hendrik (2019)
Partitioning into Isomorphic or Connected Subgraphs.
Technische Universität Darmstadt
Dissertation, Erstveröffentlichung

Huang, Wei (2019)
Optimal Operation of Water Supply Networks by Mixed Integer Nonlinear Programming and Algebraic Methods.
Technische Universität Darmstadt
Dissertation, Erstveröffentlichung

Disser, Y. ; Hopp, A. V.
Hrsg.: Lodi, A. ; Nagarajan, V. (2019)
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.
20th Interantional Conference on Integer Programming and Combinatorial Optimization (IPCO 2019). Ann Arbor, USA (22.05.2019-24.05.2019)
doi: 10.1007/978-3-030-17953-3_13
Konferenzveröffentlichung, Bibliographie

Hojny, Christopher (2018)
Symmetries in binary program : A polyhedaral perspective.
Technische Universität Darmstadt
Dissertation, Bibliographie

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
Artikel, Bibliographie

Fischer, Tobias ; Pfetsch, Marc E. (2018)
Branch-and-cut for linear programs with overlapping SOS1 constraints.
In: Mathematical Programming Computation, 10 (1)
doi: 10.1007/s12532-017-0122-5
Artikel, Bibliographie

Disser, Yann ; Hopp, Alexander V. (2018)
On Friedmann's subexponential lower bound for Zadeh's pivot rule.
Report, Erstveröffentlichung

Disser, Yann ; Mousset, Frank ; Noever, Andreas ; Škorić, Nemanja ; Steger, Angelika (2017)
A general lower bound for collaborative tree exploration.
24th International Colloquium on Structural Information and Communication Complexity. Porquerolles, France (19.06.2017-22.06.2017)
doi: 10.1007/978-3-319-72050-0_8
Konferenzveröffentlichung, Bibliographie

Hojny, Christoper ; Pfetsch, Marc E. ; Schmitt, Andreas (2017)
Extended Formulations for Column Constrained Orbitopes.
International Conference of the German Operations Research Society. Berlin, Germany (06.09.2017-08.09.2017)
Konferenzveröffentlichung, Bibliographie

Bernstein, Aaron ; Disser, Yann ; Groß, Martin (2017)
General Bounds for Incremental Maximization.
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Warsaw, Poland (10.07.2017-14.07.2017)
doi: 10.4230/LIPIcs.ICALP.2017.43
Konferenzveröffentlichung, Bibliographie

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.
Report, Bibliographie

Abed, F. ; Chen, L. ; Disser, Y. ; Groß, M. ; Megow, N. ; Meißner, J. ; Richter, A. ; Rischke, R. (2017)
Scheduling Maintenance Jobs in Networks.
10th International Conference on Algorithms and Complexity. Athens, Greece (24.05.2017-26.05.2017)
doi: 10.1007/978-3-319-57586-5_3
Konferenzveröffentlichung, Bibliographie

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.
28th Annual ACM-SIAM Symposium on Discrete Algorithms. Barcelona, Spain (16.01.2017-19.01.2017)
doi: 10.1137/1.9781611974782.63
Konferenzveröffentlichung, Bibliographie

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).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Kratsch, S. (2017)
Robust and adaptive search.
Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Klimm, M. ; Megow, N. ; Stiller, S. (2017)
Packing a knapsack of unknown capacity.
In: SIAM Journal on Discrete Mathematics, 31 (3)
Artikel, Bibliographie

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.
23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016). Helsinki, Finnland (19.07.2016-21.07.2016)
doi: 10.1007/978-3-319-48314-6_17
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Skiena, S. S.
Hrsg.: Goodman, J. E. ; O'Rourke, J. ; Tóth, C. D. (2016)
Geometric Reconstruction Problems.
In: Handbook of Discrete and Computational Geometry
Buchkapitel, Bibliographie

Disser, Y. ; Matuschke, J. (2016)
Degree-constrained orientations of embedded graphs.
In: Journal of Combinatorial Optimization, 3
Artikel, Bibliographie

Disser, Y. ; Hackfeld, J. ; Klimm, M. (2016)
Undirected Graph Exploration with Θ(log log n) Pebbles.
Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
Konferenzveröffentlichung, Bibliographie

Böhmová, K. ; Disser, Y. ; Mihalák, M. ; Sramek, R. (2016)
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.
Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN).
Konferenzveröffentlichung, Bibliographie

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
Artikel, Bibliographie

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
Artikel, Bibliographie

Dereniowski, D. ; Disser, Y. ; Kosowski, A. ; Pająk, D. ; Uznański, P. (2015)
Fast Collaborative Graph Exploration.
In: Information and Computation, 243
Artikel, Bibliographie

Disser, Y. ; Skutella, M. (2015)
The Simplex Algorithm is NP-mighty.
26th ACM-SIAM Symposium on Discrete Algorithms. San Diego, USA (04.01.2015-06.01.2015)
doi: 10.1137/1.9781611973730.59
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Klimm, M. ; Lübbecke, E. (2015)
Scheduling Bidirectional Traffic on a Path.
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Mihalák, M. ; Montanari, S. (2015)
Max Shortest Path for Imprecise Points.
Proceedings of the 30th European Workshop on Computational Geometry (EuroCG).
Konferenzveröffentlichung, Bibliographie

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).
Konferenzveröffentlichung, Bibliographie

Paffenholz, Andreas (2015)
Faces of Birkhoff Polytopes.
In: Electronic Journal of Combinatorics, 22 (1)
Artikel, Bibliographie

Disser, Y. ; Ghosh, S. K. ; Mihalák, M. ; Widmayer, P. (2014)
Mapping a polygon with holes using a compass.
In: Theoretical Computer Science, 553
Artikel, Bibliographie

Disser, Y. ; Megow, N. ; Klimm, M. ; Stiller, S. (2014)
Packing a Knapsack of Unknown Capacity.
Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Mihalák, M. ; Montanari, S. ; Widmayer, P. (2014)
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.
Proceedings of the International Symposium on Combinatorial Optimization (ISCO).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Kratsch, S. ; Sorge, M. (2014)
The Minimum Feasible Tileset Problem.
12th Workshop on Approximation and Online Algorithms (WAOA 2014). Wrolaw, Poland (11.09.2014-12.09.2014)
doi: 10.1007/978-3-319-18263-6_13
Konferenzveröffentlichung, Bibliographie

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2013)
Mapping Simple Polygons: How Robots Benefit from Looking Back.
In: Algorithmica, 65
Artikel, Bibliographie

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
Artikel, Bibliographie

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.
Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC).
Konferenzveröffentlichung, Bibliographie

Böhmová, K. ; Disser, Y. ; Widmayer, P. ; Mihalák, M. (2013)
Interval Selection with Machine-Dependent Intervals.
Proceedings of the 13th International Algorithms and Data Structures Symposium (WADS).
Konferenzveröffentlichung, Bibliographie

Dereniowski, D. ; Disser, Y. ; Kosowski, A. ; Pająk, D. ; Uznański, P. (2013)
Fast Collaborative Graph Exploration.
Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP).
Konferenzveröffentlichung, Bibliographie

Bilò, D. ; Disser, Y. ; Gualà, L. ; Mihalák, M. ; Proietti, G. ; Widmayer, P. (2013)
Polygon-Constrained Motion Planning Problems.
Proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS).
Konferenzveröffentlichung, Bibliographie

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
Artikel, Bibliographie

Disser, Y. ; Ghosh, S. K. ; Mihalák, M. ; Widmayer, P. (2012)
Mapping a polygon with holes using a compass.
Proceedings of the 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2012)
Mapping polygons with agents that measure angles.
Proceedings of the 10th International Workshop on the Algorithmic Foundations of Robotics (WAFR).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Matuschke, J. (2012)
Degree-constrained orientations of embedded graphs.
Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC).
Konferenzveröffentlichung, Bibliographie

Disser, Y. (2011)
Mapping Polygons.
Eidgenössische Technische Hochschule Zürich
Dissertation, Bibliographie

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2011)
A polygon is determined by its angles.
In: Computational Geometry: Theory and Applications, 44
Artikel, Bibliographie

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2011)
Telling convex from reflex allows to map a polygon.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Mihalák, M. ; Widmayer, P. (2010)
Reconstructing a simple polygon from its angles.
Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT).
Konferenzveröffentlichung, Bibliographie

Chalopin, J. ; Das, S. ; Disser, Y. ; Mihalák, M. ; Widmayer, P. (2010)
How Simple Robots Benefit from Looking Back.
Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC).
Konferenzveröffentlichung, Bibliographie

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
doi: 10.1287/ijoc.1100.0429
Artikel, Bibliographie

Bilò, D. ; Disser, Y. ; Mihalák, M. ; Suri, S. ; Vicari, E. ; Widmayer, P. (2009)
Reconstructing Visibility Graphs with Simple Robots.
Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO).
Konferenzveröffentlichung, Bibliographie

Disser, Y. ; Bilò, D. ; Mihalák, M. ; Suri, S. ; Vicari, E. ; Widmayer, P. (2009)
On the Limitations of Combinatorial Visibilities.
Proceedings of the 25th European Workshop on Computational Geometry (EuroCG).
Konferenzveröffentlichung, Bibliographie

Wilms, J. ; Disser, Y. ; Alber, G. ; Percival, I. C. (2008)
Local Realism, Detection Efficiencies, and Probability Polytopes.
In: Physical Review A, 78 (3)
doi: 10.1103/PhysRevA.78.032116
Artikel, Bibliographie

Disser, Y. ; Müller-Hannemann, M. ; Schnee, M. (2008)
Multi-criteria Shortest Paths in Time-Dependent Train Networks.
Proceedings of the 7th International Workshop on Experimental Algorithms (WEA).
Konferenzveröffentlichung, Bibliographie

Witte, Nikolaus (2007)
Foldable Triangulations.
Technische Universität Darmstadt
Dissertation, Erstveröffentlichung

Paffenholz, Andreas ; Ziegler, Günter M. (2004)
The E_t-construction for lattices, spheres and polytopes.
In: Discrete Comput. Geom., 32 (4)
doi: 10.1007/s00454-004-1140-4
Artikel, Bibliographie