| Publication | Date of Publication | Type |
|---|
Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs
Discrete Applied Mathematics | 2024-12-04 | Paper |
Sequential solutions in machine scheduling games
Journal of Scheduling | 2024-10-16 | Paper |
| On sorting with a network of two stacks | 2024-08-22 | Paper |
| Snakes and Ladders: A Treewidth Story | 2024-05-03 | Paper |
Sequence Hypergraphs: Paths, Flows, and Cuts
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Sequential solutions in machine scheduling games
(available as arXiv preprint) | 2023-03-21 | Paper |
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
(available as arXiv preprint) | 2022-07-21 | Paper |
Collective fast delivery by energy-efficient agents
(available as arXiv preprint) | 2021-08-04 | Paper |
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Theoretical Computer Science | 2021-05-10 | Paper |
Tree Nash Equilibria in the Network Creation Game
Internet Mathematics | 2021-04-26 | Paper |
Near-gathering of energy-constrained mobile agents
Theoretical Computer Science | 2020-12-15 | Paper |
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Near-gathering of energy-constrained mobile agents
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Collaborative delivery with energy-constrained mobile robots
Theoretical Computer Science | 2020-02-06 | Paper |
| Bi-directional search for robust routes in time-dependent bi-criteria road networks | 2019-10-24 | Paper |
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences
2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Improved bounds on equilibria solutions in the network design game
International Journal of Game Theory | 2018-12-28 | Paper |
Mapping Simple Polygons
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| Polygon-constrained motion planning problems | 2018-10-17 | Paper |
| Data delivery by energy-constrained mobile agents | 2018-10-17 | Paper |
| On a fixed haplotype variant of the minimum error correction problem | 2018-10-04 | Paper |
Computing and listing \(st\)-paths in public transportation networks
Theory of Computing Systems | 2018-06-01 | Paper |
Selecting vertex disjoint paths in plane graphs
Networks | 2018-05-23 | Paper |
Improved bounds for the conflict-free chromatic art gallery problem
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Robust optimization in the presence of uncertainty: a generic approach
Journal of Computer and System Sciences | 2018-04-18 | Paper |
Robust optimization in the presence of uncertainty
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Sequence hypergraphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Mapping a Polygon with Holes Using a Compass
Algorithms for Sensor Systems | 2016-12-19 | Paper |
Collaborative delivery with energy-constrained mobile robots
Lecture Notes in Computer Science | 2016-12-01 | Paper |
Approximating interval selection on unrelated machines with unit-length intervals and cores
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Bribeproof Mechanisms for Two-Values Domains
Algorithmic Game Theory | 2016-09-29 | Paper |
Computing and listing \(st\)-paths in public transportation networks
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Scheduling transfers of resources over time: towards car-sharing with flexible drop-offs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Approximately counting approximately-shortest paths in directed acyclic graphs
Theory of Computing Systems | 2016-03-21 | Paper |
Multicast network design game on a ring
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Recurring comparison faults: sorting and finding the minimum
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Tree Nash equilibria in the network creation game
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
Theoretical Computer Science | 2014-12-02 | Paper |
An \(H _{n/2}\) upper bound on the price of stability of undirected network design games
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Mapping a polygon with holes using a compass
Theoretical Computer Science | 2014-09-18 | Paper |
Counting approximately-shortest paths in directed acyclic graphs
Approximation and Online Algorithms | 2014-09-02 | Paper |
Data delivery by energy-constrained mobile agents on a line
Automata, Languages, and Programming | 2014-07-01 | Paper |
Simple agents learn to find their way: an introduction on mapping polygons
Discrete Applied Mathematics | 2014-04-16 | Paper |
| Robust routing in urban public transportation: how to find reliable journeys based on past observations | 2014-02-24 | Paper |
The price of anarchy in network creation games is (mostly) constant
Theory of Computing Systems | 2013-10-21 | Paper |
Interval selection with machine-dependent intervals
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Improving the \(H _{k }\)-bound on the price of stability in undirected Shapley network design games
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Mapping simple polygons: how robots benefit from looking back
Algorithmica | 2013-03-05 | Paper |
| Vertex disjoint paths for dispatching in railways | 2012-09-28 | Paper |
| Track allocation in freight-train classification with mixed tracks | 2012-09-28 | Paper |
Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Reconstructing visibility graphs with simple robots
Theoretical Computer Science | 2012-08-10 | Paper |
| scientific article; zbMATH DE number 5999543 (Why is no real title available?) | 2012-01-23 | Paper |
Maximum independent set in 2-direction outersegment graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
How to guard a graph?
Algorithmica | 2011-12-14 | Paper |
A polygon is determined by its angles
Computational Geometry | 2011-08-02 | Paper |
On the Complexity of the Metric TSP under Stability Considerations
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
The Price of Anarchy in Network Creation Games Is (Mostly) Constant
Algorithmic Game Theory | 2010-10-19 | Paper |
Reconstructing a simple polygon from its angles
Lecture Notes in Computer Science | 2010-06-22 | Paper |
How simple robots benefit from looking back
Lecture Notes in Computer Science | 2010-05-28 | Paper |
A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
Approximation and Online Algorithms | 2010-05-11 | Paper |
Discovery of network properties with all-shortest-paths queries
Theoretical Computer Science | 2010-04-06 | Paper |
Reconstructing visibility graphs with simple robots
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Shunting for Dummies: An Introductory Algorithmic Survey
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Approximate Discovery of Random Graphs
Stochastic Algorithms: Foundations and Applications | 2009-03-05 | Paper |
How to Guard a Graph?
Algorithms and Computation | 2009-01-29 | Paper |
Simple Robots in Polygonal Environments: A Hierarchy
1522.68597 | 2009-01-22 | Paper |
Angle Optimization in Target Tracking
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Discovery of Network Properties with All-Shortest-Paths Queries
Structural Information and Communication Complexity | 2008-07-10 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
An algorithmic view on OVSF code assignment
Algorithmica | 2007-04-26 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
