TU Darmstadt / ULB / TUbiblio

Einträge mit Organisationseinheit "04 Fachbereich Mathematik > Optimierung > Discrete Optimization"

Ebene hoch
Gruppiere nach: Autor(en) | Datum | Typ des Eintrags | Sprache | Keine Gruppierung
Springe zu: A | B | C | D | M | W
Anzahl der Einträge auf dieser Ebene: 44.

A

Abed, F. ; Chen, L. ; Disser, Y. ; Groß, M. ; Megow, N. ; Meißner, J. ; Richter, A. ; Rischke, R. :
Scheduling Maintenance Jobs in Networks.
In: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC).
[Konferenz- oder Workshop-Beitrag], (2017)

B

Bjelde, A. ; Disser, Y. ; Hackfeld, J. ; Hansknecht, C. ; Lipmann, M. ; Meißner, J. ; Schewior, K. ; Schlöter, M. ; Stougie, L. :
Tight bounds for online TSP on the line.
In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
[Konferenz- oder Workshop-Beitrag], (2017)

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

Bärtschi, A. ; Chalopin, J. ; Das, S. ; Disser, Y. ; Geissmann, B. ; Graf, D. ; Labourel, A. ; Mihalák, M. :
Collaborative Delivery with Energy-Constrained Mobile Robots.
In: Theoretical Computer Science
[Artikel], (2017) (Im Druck)

Bernstein, A. ; Disser, Y. ; Groß, M. :
General Bounds for Incremental Maximization.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)
[Konferenz- oder Workshop-Beitrag], (2017)

Bärtschi, A. ; Chalopin, J. ; Das, S. ; Disser, Y. ; Geissmann, B. ; Graf, D. ; Labourel, A. ; Mihalák, M. :
Collaborative Delivery with Energy-Constrained Mobile Robots.
In: Proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO).
[Konferenz- oder Workshop-Beitrag], (2016)

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

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

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

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

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

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

C

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

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

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

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

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

D

Disser, Y. ; Mousset, Frank ; Noever, Andreas ; Škorić, Nemanja ; Steger, Angelika :
A general lower bound for collaborative tree exploration.
Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO)
[Konferenz- oder Workshop-Beitrag], (2017)

Disser, Y. ; Kratsch, S. :
Robust and adaptive search.
In: Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS).
[Konferenz- oder Workshop-Beitrag], (2017)

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

Disser, Y. ; Skiena, S.S.
Goodman, J.E. ; O'Rourke, J. ; Tóth, C.D. (eds.) :

Geometric Reconstruction Problems.
In: Handbook of Discrete and Computational Geometry. CRC Press LLC
[Buchkapitel], (2016) (Im Druck)

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

Disser, Y. ; Hackfeld, J. ; Klimm, M. :
Undirected Graph Exploration with Θ(log log n) Pebbles.
In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
[Konferenz- oder Workshop-Beitrag], (2016)

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

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

Disser, Y. ; Skutella, M. :
The Simplex Algorithm is NP-mighty.
In: Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms (SODA).
[Konferenz- oder Workshop-Beitrag], (2015)

Disser, Y. ; Klimm, M. ; Lübbecke, E. :
Scheduling Bidirectional Traffic on a Path.
In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP).
[Konferenz- oder Workshop-Beitrag], (2015)

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

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

Disser, Y. ; Megow, N. ; Klimm, M. ; Stiller, S. :
Packing a Knapsack of Unknown Capacity.
In: Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS).
[Konferenz- oder Workshop-Beitrag], (2014)

Disser, Y. ; Mihalák, M. ; Montanari, S. ; Widmayer, P. :
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.
In: Proceedings of the International Symposium on Combinatorial Optimization (ISCO).
[Konferenz- oder Workshop-Beitrag], (2014)

Disser, Y. ; Kratsch, S. ; Sorge, M. :
The Minimum Feasible Tileset Problem.
In: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA).
[Konferenz- oder Workshop-Beitrag], (2014)

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

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

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

Disser, Y. ; Mihalák, M. ; Widmayer, P. :
Mapping polygons with agents that measure angles.
In: Proceedings of the 10th International Workshop on the Algorithmic Foundations of Robotics (WAFR).
[Konferenz- oder Workshop-Beitrag], (2012)

Disser, Y. ; Matuschke, J. :
Degree-constrained orientations of embedded graphs.
In: Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC).
[Konferenz- oder Workshop-Beitrag], (2012)

Disser, Y. :
Mapping Polygons.
ETH Zurich , Logos Berlin
[Dissertation]

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

Disser, Y. ; Mihalák, M. ; Widmayer, P. :
Reconstructing a simple polygon from its angles.
In: Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT).
[Konferenz- oder Workshop-Beitrag], (2010)

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

Disser, Y. ; Müller-Hannemann, M. ; Schnee, M. :
Multi-criteria Shortest Paths in Time-Dependent Train Networks.
In: Proceedings of the 7th International Workshop on Experimental Algorithms (WEA).
[Konferenz- oder Workshop-Beitrag], (2008)

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 :
The SCIP Optimization Suite 4.0.
[Online-Edition: https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/...]
In: ZIB-Report , 17 (12).
[Report], (2017)

W

Wilms, J. ; Disser, Y. ; Alber, G. ; Percival, I. C. :
Local Realism, Detection Efficiencies, and Probability Polytopes.
In: Physical Review A, 73 032116(8).
[Artikel], (2008)

Diese Liste wurde am Sun Aug 20 06:49:04 2017 CEST generiert.