Papakonstantinou, The complexity of the travelling repairman problem, (2008)
F. Afrati, S. Cosmadakis, C. H. Papadimitriou, G. Papageorgiou, N. Ascheuer, S. O. Krumke, ...
[3] M.J. Atallah and S.R. Kosaraju, Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAM Journal
D. Kapur, J. L. Mundy, Mit Press, C. H. Papadimitriou, K. Steiglitz, Combinatorial Optimization, ...
[37] S. H. Suh and K. G. Shin, A variational dynamic programming approach to robot-path planning
N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, C. H. Papadimitriou
Abstract. T. Parsons originally proposed and studied the following pursuit-evasion problem on graphs: Members of a team of searchers traverse the edges of a graph G in pursuit of a fugitive, who...
Mohammad Tehranipoor, Mohammad Tehranipoor, C. H. Papadimitriou, K. Steiglitz, Combinatorial Optimization
The connectivity of boolean satisfiability: Computational and structural dichotomies (2006)
P. Gopalan, Ph. G. Kolaitis, E. N. Maneva, C. H. Papadimitriou
Incremental Recompilation of Knowledge (1997)
Gogic, G., Papadimitriou, C. H., Sideri, M.
Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn core, respectively) was proposed by Selman and Kautz (1991, 1996) as a form of ``knowledge...
Topological Queries in Spatial Databases (1996)
C.H. Papadimitriou, D. Suciu, V. Vianu
We study topological queries over two-dimensional spatial databases. First, we show that the topological properties of semi-algebraic spatial regions can be completely specified using a classical...
Topological Queries in Spatial Databases (1996)
Papadimitriou Suciu, C. H. Papadimitriou, D. Suciu, V. Vianu
We study query language for topological properties of twodimensional spatial databases, starting from the topological relationships between pairs of planar regions introduced by Egenhofer and...
Topological Queries in Spatial Databases (1996)
C.H. Papadimitriou, D. Suciu, V. Vianu
We study topological queries over two-dimensional spatial databases. First, we show that the topological properties of semi-algebraic spatial regions can be completely specified using a classical...
Topological Queries in Spatial Databases (1996)
C.H. Papadimitriou, D. Suciu, V. Vianu
We study query language for topological properties of twodimensional spatial databases, starting from the topological relationships between pairs of planar regions introduced by Egenhofer and...
The complexity of multiterminal cuts (1994)
E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis
In the Multiterminal Cut problem we are given an edge-weighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all...
The Power of Reflective Relational Machines (1994)
S. Abiteboul, C.H. Papadimitriou, V. Vianu
A model of database programming with reflection, called reflective relational machine, is introduced and studied. The reflection consists here of dynamic generation of queries in a host programming...
The complexity of multiterminal cuts (1994)
E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis
In the Multiterminal Cut problem we are given an edge-weighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all...
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision (1990)
Mitchell, J. S. B., Papadimitriou, C. H.
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision (1990)
Mitchell, J. S. B., Papadimitriou, C. H.
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision