The SCEAS System
| |||||||

## Search the dblp DataBase
Adrian Dumitrescu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan
**Separating points by axis-parallel lines.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:7-10 [Conf] - Adrian Dumitrescu
**A remark on the Erdös-Szekeres theorem.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:2-3 [Conf] - Adrian Dumitrescu
**On some monotone path problems in line arrangements.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:200-203 [Conf] - Adrian Dumitrescu
**Planar sets with few empty convex polygons.**[Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf] - Adrian Dumitrescu
**On two lower bound constructions.**[Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf] - Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
**Enumerating Triangulation Paths.**[Citation Graph (0, 0)][DBLP] CCCG, 2000, pp:- [Conf] - Adrian Dumitrescu, Günter Rote
**On the Fréchet distance of a set of curves.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:162-165 [Conf] - Adrian Dumitrescu, Géza Tóth
**Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.**[Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf] - Sergey Bereg, Adrian Dumitrescu
**The lifting model for reconfiguration.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:55-62 [Conf] - Adrian Dumitrescu
**On distinct distances from a vertex of a convex polygon.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2004, pp:57-60 [Conf] - Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
**Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2001, pp:141-150 [Conf] - Adrian Dumitrescu, János Pach
**Pushing squares around.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2004, pp:116-123 [Conf] - Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
**Traversing a set of points with a minimum number of turns.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:46-55 [Conf] - Adrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski
**Offline variants of the "lion and man" problem.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:102-111 [Conf] - Adrian Dumitrescu, Sumanta Guha
**Extreme Distances in Multicolored Point Sets.**[Citation Graph (0, 0)][DBLP] International Conference on Computational Science (3), 2002, pp:14-25 [Conf] - Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita
**High Speed Formations of Reconfigurable Modular Robotic Systems.**[Citation Graph (0, 0)][DBLP] ICRA, 2002, pp:123-128 [Conf] - Adrian Dumitrescu
**Efficient Algorithms for Generation of Combinatorial Covering Suites.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:300-308 [Conf] - Sergey Bereg, Adrian Dumitrescu, János Pach
**Sliding Disks in the Plane.**[Citation Graph (0, 0)][DBLP] JCDCG, 2004, pp:37-47 [Conf] - Gruia Calinescu, Adrian Dumitrescu, János Pach
**Reconfigurations in Graphs and Grids.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:262-273 [Conf] - Christine Cheng, Adrian Dumitrescu, Patrick J. Schroeder
**Generating Small Combinatorial Test Suites to Cover Input-Output Relationships.**[Citation Graph (0, 0)][DBLP] QSIC, 2003, pp:76-82 [Conf] - Adrian Dumitrescu
**An approximation algorithm for cutting out convex polygons.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:823-827 [Conf] - Adrian Dumitrescu, Joseph S. B. Mitchell
**Approximation algorithms for TSP with neighborhoods in the plane.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:38-46 [Conf] - Adrian Dumitrescu, Csaba D. Tóth
**Light Orthogonal Networks with Constant Geometric Dilation.**[Citation Graph (0, 0)][DBLP] STACS, 2007, pp:175-187 [Conf] - Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
**On Geometric Dilation and Halving Chords.**[Citation Graph (0, 0)][DBLP] WADS, 2005, pp:244-255 [Conf] - Adrian Dumitrescu, János Pach
**Partitioning Colored Point Sets into Monochromatic Parts.**[Citation Graph (0, 0)][DBLP] WADS, 2001, pp:264-275 [Conf] - Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia
**On the chromatic number of some geometric type Kneser graphs.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:32, n:1, pp:59-69 [Journal] - Adrian Dumitrescu
**An approximation algorithm for cutting out convex polygons.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2004, v:29, n:3, pp:223-231 [Journal] - Adrian Dumitrescu
**On some monotone path problems in line arrangements.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:32, n:1, pp:13-25 [Journal] - Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
**Enumerating triangulation paths.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:20, n:1-2, pp:3-12 [Journal] - Adrian Dumitrescu, Rick Kaye
**Matching colored points in the plane: Some new results.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:19, n:1, pp:69-85 [Journal] - Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
**On the geometric dilation of closed curves, graphs, and point sets.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:36, n:1, pp:16-38 [Journal] - Adrian Dumitrescu
**The cost of cutting out convex**[Citation Graph (0, 0)][DBLP]*n*-gons. Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:353-358 [Journal] - Sergey Bereg, Adrian Dumitrescu
**The Lifting Model for Reconfiguration.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2006, v:35, n:4, pp:653-669 [Journal] - Adrian Dumitrescu
**Monotone Paths in Line Arrangements with a Small Number of Directions.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2005, v:33, n:4, pp:687-697 [Journal] - Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
**Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2004, v:31, n:2, pp:207-227 [Journal] - Adrian Dumitrescu
**On Distinct Distances from a Vertex of a Convex Polygon.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2006, v:36, n:4, pp:503-509 [Journal] - Adrian Dumitrescu, William L. Steiger
**On a matching problem in the plane.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:211, n:, pp:183-195 [Journal] - Adrian Dumitrescu, János Pach
**Pushing Squares Around.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2006, v:22, n:1, pp:37-50 [Journal] - Adrian Dumitrescu, Géza Tóth
**Ramsey-Type Results for Unions of Comparability Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:2, pp:245-251 [Journal] - Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan
**Separating Points by Axis-parallel Lines.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2005, v:15, n:6, pp:575-590 [Journal] - Adrian Dumitrescu, János Pach
**Partitioning Colored Point Sets into Monochromatic Parts.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2002, v:12, n:5, pp:401-412 [Journal] - Adrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita
**Formations for Fast Locomotion of Metamorphic Robotic Systems.**[Citation Graph (0, 0)][DBLP] I. J. Robotic Res., 2004, v:23, n:6, pp:583-593 [Journal] - Adrian Dumitrescu, William L. Steiger
**Space-time trade-offs for some ranking and searching queries.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:79, n:5, pp:237-241 [Journal] - Adrian Dumitrescu, Joseph S. B. Mitchell
**Approximation algorithms for TSP with neighborhoods in the plane.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:135-159 [Journal] - Adrian Dumitrescu, Sumanta Guha
**Extreme Distances in Multicolored Point Sets.**[Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2004, v:8, n:, pp:27-38 [Journal] - Adrian Dumitrescu, Csaba D. Tóth
**Distinct Triangle Areas in a Planar Point Set.**[Citation Graph (0, 0)][DBLP] IPCO, 2007, pp:119-129 [Conf] - Adrian Dumitrescu, Csaba D. Tóth
**On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1114-1123 [Conf] **Sweeping Points.**[Citation Graph (, )][DBLP]**Monochromatic simplices of any volume.**[Citation Graph (, )][DBLP]**On distinct distances among points in general position and other related problems.**[Citation Graph (, )][DBLP]**The traveling salesman problem for lines and rays in the plane.**[Citation Graph (, )][DBLP]**Approximate euclidean ramsey theorems.**[Citation Graph (, )][DBLP]**Constrained k-center and movement to independence.**[Citation Graph (, )][DBLP]**Watchman tours for polygons with holes.**[Citation Graph (, )][DBLP]**Extremal problems on triangle areas in two and three dimensions.**[Citation Graph (, )][DBLP]**Convexification of polygons by length preserving transformations.**[Citation Graph (, )][DBLP]**Piercing Translates and Homothets of a Convex Body.**[Citation Graph (, )][DBLP]**Improved lower bound on the geometric dilation of point sets.**[Citation Graph (, )][DBLP]**Drawing Hamiltonian Cycles with No Large Angles.**[Citation Graph (, )][DBLP]**New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body.**[Citation Graph (, )][DBLP]**Minimum-Perimeter Intersecting Polygons.**[Citation Graph (, )][DBLP]**Minimum weight convex Steiner partitions.**[Citation Graph (, )][DBLP]**On stars and Steiner stars.**[Citation Graph (, )][DBLP]**On stars and Steiner stars: II.**[Citation Graph (, )][DBLP]**The Forest Hiding Problem.**[Citation Graph (, )][DBLP]**Dispersion in Unit Disks.**[Citation Graph (, )][DBLP]**Long Non-crossing Configurations in the Plane.**[Citation Graph (, )][DBLP]**On Covering Problems of Rado.**[Citation Graph (, )][DBLP]**Vision-Based Pursuit-Evasion in a Grid.**[Citation Graph (, )][DBLP]**On Reconfiguration of Disks in the Plane and Related Problems.**[Citation Graph (, )][DBLP]**Compatible geometric matchings.**[Citation Graph (, )][DBLP]**On stars and Steiner stars. II**[Citation Graph (, )][DBLP]**Minimum clique partition in unit disk graphs**[Citation Graph (, )][DBLP]**On the largest empty axis-parallel box amidst n points**[Citation Graph (, )][DBLP]**Long non-crossing configurations in the plane**[Citation Graph (, )][DBLP]**Piercing translates and homothets of a convex body**[Citation Graph (, )][DBLP]**On convexification of polygons by pops**[Citation Graph (, )][DBLP]**Dispersion in unit disks**[Citation Graph (, )][DBLP]**Approximate Euclidean Ramsey theorems**[Citation Graph (, )][DBLP]**Opaque sets**[Citation Graph (, )][DBLP]**Coloring translates and homothets of a convex body**[Citation Graph (, )][DBLP]**On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space.**[Citation Graph (, )][DBLP]**Traversing a Set of Points with a Minimum Number of Turns.**[Citation Graph (, )][DBLP]**On distinct distances and lambda-free point sets.**[Citation Graph (, )][DBLP]**Monochromatic simplices of any volume.**[Citation Graph (, )][DBLP]**On convexification of polygons by pops.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.010secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |