Widmayer Peter

Peter Widmayer

Information about the author Peter Widmayer will soon be added to the site.
Found 7 papers in total
Selecting vertex disjoint paths in plane graphs
Selecting vertex disjoint paths in plane graphs
2015
We study variants of the vertex disjoint paths problem in plane graphs where paths...
Mapping Simple Polygons: How Robots Benefit from Looking Back
Mapping Simple Polygons: How Robots Benefit from Looking Back
2013
We consider the problem of mapping an initially unknown polygon of size n with a...
How to Guard a Graph?
How to Guard a Graph?
2011
We initiate the study of the algorithmic foundations of games in which a set of cops...
On robust online scheduling algorithms
On robust online scheduling algorithms
2011
While standard parallel machine scheduling is concerned with good assignments of jobs...
On the approximability of the travelling salesperson problem on local modifications of optimally solved instances
On the approximability of the travelling salesperson problem on local modifications of optimally solved instances
2007
Given an instance of TSP together with an optimal solution, we consider the scenario...
Job shop scheduling with unit length tasks: bounds and algorithms
Job shop scheduling with unit length tasks: bounds and algorithms
2007
We consider the job shop scheduling problem unit–J m , where each job is...
On graphs preserving rectilinear shortest paths in the presence of obstacles
On graphs preserving rectilinear shortest paths in the presence of obstacles
1991
In physical VLSI design, network design (wiring) is the most time-consuming phase. For...
Papers per page: