| Publication | Date of Publication | Type |
|---|
Sequence Hypergraphs: Paths, Flows, and Cuts
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Balanced distributed search trees do not exist
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Relaxed balance through standard rotations
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Enclosing many boxes by an optimal pair of boxes
STACS 92 | 2022-08-18 | Paper |
Time is not a healer (preliminary version)
STACS 89 | 2022-08-16 | Paper |
Space filling curves and their use in the design of geometric data structures
LATIN '95: Theoretical Informatics | 2022-08-16 | 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 |
scientific article; zbMATH DE number 6876112 (Why is no real title available?)
| 2018-05-29 | 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 |
A better scoring model for de novo peptide sequencing: the symmetric difference between explained and measured masses
| 2018-03-23 | Paper |
Algorithms and data structures
| 2017-12-04 | Paper |
An inherent bottleneck in distributed counting
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Robust optimization in the presence of uncertainty
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
Search Theory | 2017-02-20 | 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 |
Bribeproof Mechanisms for Two-Values Domains
Algorithmic Game Theory | 2016-09-29 | Paper |
Finding the detour-critical edge of a shortest path between two nodes
Information Processing Letters | 2016-06-09 | Paper |
Approximately counting approximately-shortest paths in directed acyclic graphs
Theory of Computing Systems | 2016-03-21 | 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 |
An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs
Algorithmica | 2015-03-02 | 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 |
Interval selection with machine-dependent intervals
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Corner cuts are close to optimal: from solid grids to polygons and back
Discrete Applied Mathematics | 2013-04-25 | 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 |
Reconstructing visibility graphs with simple robots
Theoretical Computer Science | 2012-08-10 | Paper |
Computing all the best swap edges distributively
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
scientific article; zbMATH DE number 5999543 (Why is no real title available?)
| 2012-01-23 | Paper |
Restricted cuts for bisections in solid grids: a proof via polygons
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | 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 |
An \(\mathcal{O}(n^4)\) time algorithm to compute the bisection width of solid grid graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
A polygon is determined by its angles
Computational Geometry | 2011-08-02 | Paper |
On robust online scheduling algorithms
Journal of Scheduling | 2011-05-30 | Paper |
Optimal placement of ad hoc devices under a VCG-style routing protocol
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
scientific article; zbMATH DE number 5859273 (Why is no real title available?)
| 2011-03-01 | Paper |
Computing all best swaps for minimum-stretch tree spanners
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
On the Complexity of the Metric TSP under Stability Considerations
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Algorithmen und Datenstrukturen
| 2010-12-22 | Paper |
Rendezvous of mobile agents in directed graphs
Lecture Notes in Computer Science | 2010-09-10 | 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 |
Approximate shortest paths guided by a small index
Algorithmica | 2010-05-28 | Paper |
Discovery of network properties with all-shortest-paths queries
Theoretical Computer Science | 2010-04-06 | Paper |
Stability of networks in stretchable graphs
Structural Information and Communication Complexity | 2010-02-24 | 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 |
Online train disposition: to wait or not to wait?
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Single machine batch scheduling with release times
Journal of Combinatorial Optimization | 2009-10-09 | Paper |
scientific article; zbMATH DE number 5604124 (Why is no real title available?)
| 2009-09-15 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Strongly polynomial-time truthful mechanisms in one shot
Theoretical Computer Science | 2009-04-29 | Paper |
Approximate Shortest Paths Guided by a Small Index
Lecture Notes in Computer Science | 2009-02-17 | Paper |
On the Robustness of Graham’s Algorithm for Online Scheduling
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Reoptimization of Weighted Graph and Covering Problems
Approximation and Online Algorithms | 2009-02-12 | Paper |
Computing Best Swaps in Optimal Tree Spanners
Algorithms and Computation | 2009-01-29 | 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 |
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science | 2008-11-18 | Paper |
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Angle Optimization in Target Tracking
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Reoptimization of Steiner Trees
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 |
Locating Facilities on a Network to Minimize Their Average Service Radius
Algorithms and Computation | 2008-05-27 | Paper |
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
Algorithms and Computation | 2008-04-24 | Paper |
On the Hardness of Reoptimization
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science | 2007-10-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Online Single Machine Batch Scheduling
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Job shop scheduling with unit length tasks: bounds and algorithms
| 2007-08-13 | Paper |
An algorithmic view on OVSF code assignment
Algorithmica | 2007-04-26 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science | 2005-06-30 | Paper |
scientific article; zbMATH DE number 2173656 (Why is no real title available?)
| 2005-06-02 | Paper |
scientific article; zbMATH DE number 2163018 (Why is no real title available?)
| 2005-04-29 | Paper |
scientific article; zbMATH DE number 2163021 (Why is no real title available?)
| 2005-04-29 | Paper |
Distributed search trees: fault tolerance in an asynchronous environment
Theory of Computing Systems | 2005-02-11 | Paper |
The counting pyramid: an adaptive distributed counting scheme
Journal of Parallel and Distributed Computing | 2004-10-04 | Paper |
Nearly linear time minimum spanning tree maintenance for transient node failures
Algorithmica | 2004-10-01 | Paper |
Amortized Complexity of Bulk Updates in AVL-Trees
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
scientific article; zbMATH DE number 2081007 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2044495 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 2011862 (Why is no real title available?)
| 2003-12-02 | Paper |
Finding the most vital node of a shortest path.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1951565 (Why is no real title available?)
| 2003-07-21 | Paper |
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
SIAM Journal on Computing | 2003-06-19 | Paper |
Swapping a failing edge of a single source shortest paths tree is good and fast
Algorithmica | 2003-06-02 | Paper |
scientific article; zbMATH DE number 1877049 (Why is no real title available?)
| 2003-03-20 | Paper |
scientific article; zbMATH DE number 1796972 (Why is no real title available?)
| 2002-09-05 | Paper |
A faster computation of the most vital edge of a shortest path
Information Processing Letters | 2002-07-14 | Paper |
Algorithms and data structures
| 2002-04-14 | Paper |
Relaxed balance using standard rotations
Algorithmica | 2002-01-24 | Paper |
scientific article; zbMATH DE number 1688369 (Why is no real title available?)
| 2002-01-09 | Paper |
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
scientific article; zbMATH DE number 1670672 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1629980 (Why is no real title available?)
| 2001-10-23 | Paper |
Inapproximability results for guarding polygons and terrains
Algorithmica | 2001-10-14 | Paper |
scientific article; zbMATH DE number 1617263 (Why is no real title available?)
| 2001-07-11 | Paper |
Approximation algorithms for clustering to minimize the sum of diameters
Nordic Journal of Computing | 2001-04-17 | Paper |
scientific article; zbMATH DE number 1405681 (Why is no real title available?)
| 2001-02-18 | Paper |
scientific article; zbMATH DE number 1424305 (Why is no real title available?)
| 2000-09-26 | Paper |
scientific article; zbMATH DE number 1305082 (Why is no real title available?)
| 2000-03-13 | Paper |
Class Steiner trees and VLSI-design
Discrete Applied Mathematics | 1999-04-11 | Paper |
An inherent bottleneck in distributed counting
Journal of Parallel and Distributed Computing | 1998-08-20 | Paper |
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science | 1998-07-22 | Paper |
Enclosing a Set of Objects by Two Minimum Area Rectangles
Journal of Algorithms | 1997-06-22 | Paper |
scientific article; zbMATH DE number 1008516 (Why is no real title available?)
| 1997-06-12 | Paper |
scientific article; zbMATH DE number 930345 (Why is no real title available?)
| 1996-10-01 | Paper |
scientific article; zbMATH DE number 836094 (Why is no real title available?)
| 1996-01-22 | Paper |
scientific article; zbMATH DE number 686977 (Why is no real title available?)
| 1995-07-13 | Paper |
\(k\)-violation linear programming
Information Processing Letters | 1995-07-13 | Paper |
Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects
The Computer Journal | 1993-06-29 | Paper |
scientific article; zbMATH DE number 218385 (Why is no real title available?)
| 1993-06-29 | Paper |
scientific article; zbMATH DE number 219270 (Why is no real title available?)
| 1993-06-29 | Paper |
scientific article; zbMATH DE number 219265 (Why is no real title available?)
| 1993-06-29 | Paper |
scientific article; zbMATH DE number 194508 (Why is no real title available?)
| 1993-06-05 | Paper |
scientific article; zbMATH DE number 176570 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176576 (Why is no real title available?)
| 1993-05-18 | Paper |
On graphs preserving rectilinear shortest paths in the presence of obstacles
Annals of Operations Research | 1992-06-27 | Paper |
On the power of safe locking
Journal of Computer and System Sciences | 1990-01-01 | Paper |
A Simple Proof of the Steiner Ratio Conjecture for Five Points
SIAM Journal on Applied Mathematics | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4062555 (Why is no real title available?)
| 1988-01-01 | Paper |
Hole Problems for Rectangles in the Plane
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4049088 (Why is no real title available?)
| 1987-01-01 | Paper |
Time-and space-optimal contour computation for a set of rectangles
Information Processing Letters | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3940696 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4049033 (Why is no real title available?)
| 1986-01-01 | Paper |
Pre-analysis locking
Information and Control | 1986-01-01 | Paper |
A fast algorithm for the Boolean masking problem
Computer Vision, Graphics, and Image Processing | 1985-01-01 | Paper |
A worst-case efficient algorithm for hidden-line elimination†
International Journal of Computer Mathematics | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3958767 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3819054 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3780609 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3780617 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3780615 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3780616 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3780618 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3750318 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3686758 (Why is no real title available?)
| 1980-01-01 | Paper |
