Matús Mihalák

Mark H. M. Winands

CoRR, 2022

2021

Collaborative delivery on a fixed path with homogeneous energy-constrained agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Near-gathering of energy-constrained mobile agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2020

Collaborative delivery with energy-constrained mobile robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Sequential Solutions in Machine Scheduling Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

2019

On Sorting with a Network of Two Stacks.

[BibT_eX]

[DOI]

Marc Pont

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018

Computing and Listing st-Paths in Public Transportation Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Robust optimization in the presence of uncertainty: A generic approach.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Improved bounds on equilibria solutions in the network design game.

[BibT_eX]

[DOI]

Simone Montemezzani

Int. J. Game Theory, 2018

Collective Fast Delivery by Energy-Efficient Agents.

[BibT_eX]

[DOI]

Andreas Bärtschi

Daniel Graf

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

On a Fixed Haplotype Variant of the Minimum Error Correction Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Sequence Hypergraphs: Paths, Flows, and Cuts.

[BibT_eX]

[DOI]

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016

Optimization Methods for Multistage Freight Train Formation.

[BibT_eX]

[DOI]

Transp. Sci., 2016

Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Rastislav Srámek

Theory Comput. Syst., 2016

Sequential Solutions in Machine Scheduling Games.

[BibT_eX]

[DOI]

CoRR, 2016

Sequence Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Bribeproof Mechanisms for Two-Values Domains.

[BibT_eX]

[DOI]

Paolo Penna

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores.

[BibT_eX]

[DOI]

Katerina Böhmová

Enrico Kravina

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Computing and Listing st-Paths in Public Transportation Networks.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2016

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences.

[BibT_eX]

[DOI]

Przemyslaw Uznanski

Pencho Yordanov

Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016

2015

Improving the Hk-bound on the price of stability in undirected Shapley network design games.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Max Klimm

Theor. Comput. Sci., 2015

Mapping Simple Polygons: The Power of Telling Convex from Reflex.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2015

Selecting vertex disjoint paths in plane graphs.

[BibT_eX]

[DOI]

Networks, 2015

Tree Nash Equilibria in the Network Creation Game.

[BibT_eX]

[DOI]

Dominik Müller

Internet Math., 2015

Recurring Comparison Faults: Sorting and Finding the Minimum.

[BibT_eX]

[DOI]

Barbara Geissmann

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Multicast Network Design Game on a Ring.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks.

[BibT_eX]

[DOI]

Sandro Montanari

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past.

[BibT_eX]

[DOI]

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014

Mapping a polygon with holes using a compass.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

An $H_{n/2}$ Upper Bound on the Price of Stability of Undirected Network Design Games.

[BibT_eX]

[DOI]

Simone Montemezzani

CoRR, 2014

An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games.

[BibT_eX]

[DOI]

Simone Montemezzani

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Data Delivery by Energy-Constrained Mobile Agents on a Line.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Improved bounds for the conflict-free chromatic art gallery problem.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Frontmatter, Table of Contents, Preface, Workshop Organization.

[BibT_eX]

[DOI]

Stefan Funke

Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2013

The Price of Anarchy in Network Creation Games Is (Mostly) Constant.

[BibT_eX]

[DOI]

Jan Christoph Schlegel

Theory Comput. Syst., 2013

Simple agents learn to find their way: An introduction on mapping polygons.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Counting approximately-shortest paths in directed acyclic graphs

[BibT_eX]

[DOI]

Rastislav Srámek

CoRR, 2013

Mapping Simple Polygons: How Robots Benefit from Looking Back.

[BibT_eX]

[DOI]

Algorithmica, 2013

Counting Approximately-Shortest Paths in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Rastislav Srámek

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Interval Selection with Machine-Dependent Intervals.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Robust optimization in the presence of uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games.

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Max Klimm

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations.

[BibT_eX]

[DOI]

Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

Data Delivery by Energy-Constrained Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

Polygon-Constrained Motion Planning Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Reconstructing visibility graphs with simple robots.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games

[BibT_eX]

[DOI]

Andreas Emil Feldmann

Max Klimm

CoRR, 2012

Mapping Polygons with Agents That Measure Angles.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics X, 2012

Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games.

[BibT_eX]

[DOI]

Jan Christoph Schlegel

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

A polygon is determined by its angles.

[BibT_eX]

[DOI]

Comput. Geom., 2011

How to Guard a Graph?

[BibT_eX]

[DOI]

Algorithmica, 2011

Maximum Independent Set in 2-Direction Outersegment Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Telling convex from reflex allows to map a polygon.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On the Complexity of the Metric TSP under Stability Considerations.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Track Allocation in Freight-Train Classification with Mixed Tracks.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2011, 2011

2010

Discovery of network properties with all-shortest-paths queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Reconstructing a Simple Polygon from Its Angles.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

How Simple Robots Benefit from Looking Back.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Vertex Disjoint Paths for Dispatching in Railways.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2010, 2010

2009

Shunting for Dummies: An Introductory Algorithmic Survey.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs.

[BibT_eX]

[DOI]

Thomas Erlebach

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision.

[BibT_eX]

[DOI]

Anvesh Komuravelli

Proceedings of the Stabilization, 2009

2008

Angle Optimization in Target Tracking.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

Computing Minimum Spanning Trees with Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

Rendezvous of Mobile Agents When Tokens Fail Anytime.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Simple Robots in Polygonal Environments: A Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007

An Algorithmic View on OVSF Code Assignment.

[BibT_eX]

[DOI]

Algorithmica, 2007

Approximate Discovery of Random Graphs.

[BibT_eX]

[DOI]

Thomas Erlebach

Alexander Hall