| 2008 |
|---|
| 50 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
On stars and Steiner stars.
SODA 2008: 1233-1240 |
| 49 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
Minimum weight convex Steiner partitions.
SODA 2008: 581-590 |
| 2007 |
|---|
| 48 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
Distinct Triangle Areas in a Planar Point Set.
IPCO 2007: 119-129 |
| 47 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.
SODA 2007: 1114-1123 |
| 46 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
Light Orthogonal Networks with Constant Geometric Dilation.
STACS 2007: 175-187 |
| 45 | EE | Adrian Dumitrescu,
Ichiro Suzuki,
Pawel Zylinski:
Offline variants of the "lion and man" problem.
Symposium on Computational Geometry 2007: 102-111 |
| 44 | EE | Sergey Bereg,
Prosenjit Bose,
Adrian Dumitrescu,
Ferran Hurtado,
Pavel Valtr:
Traversing a set of points with a minimum number of turns.
Symposium on Computational Geometry 2007: 46-55 |
| 43 | EE | Adrian Dumitrescu,
Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Günter Rote:
On the geometric dilation of closed curves, graphs, and point sets.
Comput. Geom. 36(1): 16-38 (2007) |
| 42 | EE | Adrian Dumitrescu,
Csaba D. Tóth:
Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees.
J. UCS 13(11): 1615-1627 (2007) |
| 2006 |
|---|
| 41 | EE | Gruia Calinescu,
Adrian Dumitrescu,
János Pach:
Reconfigurations in Graphs and Grids.
LATIN 2006: 262-273 |
| 40 | EE | Sergey Bereg,
Adrian Dumitrescu:
The Lifting Model for Reconfiguration.
Discrete & Computational Geometry 35(4): 653-669 (2006) |
| 39 | EE | Adrian Dumitrescu:
On Distinct Distances from a Vertex of a Convex Polygon.
Discrete & Computational Geometry 36(4): 503-509 (2006) |
| 38 | EE | Adrian Dumitrescu,
János Pach:
Pushing Squares Around.
Graphs and Combinatorics 22(1): 37-50 (2006) |
| 2005 |
|---|
| 37 | EE | Sergey Bereg,
Adrian Dumitrescu:
The lifting model for reconfiguration.
Symposium on Computational Geometry 2005: 55-62 |
| 36 | EE | Adrian Dumitrescu,
Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Günter Rote:
On Geometric Dilation and Halving Chords.
WADS 2005: 244-255 |
| 35 | EE | Adrian Dumitrescu:
On some monotone path problems in line arrangements.
Comput. Geom. 32(1): 13-25 (2005) |
| 34 | EE | Gabriela Araujo,
Adrian Dumitrescu,
Ferran Hurtado,
Marc Noy,
Jorge Urrutia:
On the chromatic number of some geometric type Kneser graphs.
Comput. Geom. 32(1): 59-69 (2005) |
| 33 | EE | Adrian Dumitrescu:
Monotone Paths in Line Arrangements with a Small Number of Directions.
Discrete & Computational Geometry 33(4): 687-697 (2005) |
| 32 | EE | Gruia Calinescu,
Adrian Dumitrescu,
Howard J. Karloff,
Peng-Jun Wan:
Separating Points by Axis-parallel Lines.
Int. J. Comput. Geometry Appl. 15(6): 575-590 (2005) |
| 2004 |
|---|
| 31 | EE | Adrian Dumitrescu,
Günter Rote:
On the Fréchet distance of a set of curves.
CCCG 2004: 162-165 |
| 30 | EE | Adrian Dumitrescu:
A remark on the Erdös-Szekeres theorem.
CCCG 2004: 2-3 |
| 29 | EE | Adrian Dumitrescu:
On some monotone path problems in line arrangements.
CCCG 2004: 200-203 |
| 28 | EE | Gruia Calinescu,
Adrian Dumitrescu,
Peng-Jun Wan:
Separating points by axis-parallel lines.
CCCG 2004: 7-10 |
| 27 | EE | Sergey Bereg,
Adrian Dumitrescu,
János Pach:
Sliding Disks in the Plane.
JCDCG 2004: 37-47 |
| 26 | EE | Adrian Dumitrescu,
János Pach:
Pushing squares around.
Symposium on Computational Geometry 2004: 116-123 |
| 25 | EE | Adrian Dumitrescu:
On distinct distances from a vertex of a convex polygon.
Symposium on Computational Geometry 2004: 57-60 |
| 24 | EE | Adrian Dumitrescu:
An approximation algorithm for cutting out convex polygons.
Comput. Geom. 29(3): 223-231 (2004) |
| 23 | EE | Adrian Dumitrescu,
Joseph S. B. Mitchell,
Micha Sharir:
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles.
Discrete & Computational Geometry 31(2): 207-227 (2004) |
| 22 | EE | Adrian Dumitrescu:
The cost of cutting out convex n-gons.
Discrete Applied Mathematics 143(1-3): 353-358 (2004) |
| 21 | EE | Adrian Dumitrescu,
Ichiro Suzuki,
Masafumi Yamashita:
Formations for Fast Locomotion of Metamorphic Robotic Systems.
I. J. Robotic Res. 23(6): 583-593 (2004) |
| 20 | EE | Adrian Dumitrescu,
Sumanta Guha:
Extreme Distances in Multicolored Point Sets.
J. Graph Algorithms Appl. 8: 27-38 (2004) |
| 2003 |
|---|
| 19 | EE | Adrian Dumitrescu:
Efficient Algorithms for Generation of Combinatorial Covering Suites.
ISAAC 2003: 300-308 |
| 18 | EE | Christine Cheng,
Adrian Dumitrescu,
Patrick J. Schroeder:
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships.
QSIC 2003: 76-82 |
| 17 | EE | Adrian Dumitrescu:
An approximation algorithm for cutting out convex polygons.
SODA 2003: 823-827 |
| 16 | EE | Adrian Dumitrescu,
Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane.
J. Algorithms 48(1): 135-159 (2003) |
| 2002 |
|---|
| 15 | | Adrian Dumitrescu,
Ichiro Suzuki,
Masafumi Yamashita:
High Speed Formations of Reconfigurable Modular Robotic Systems.
ICRA 2002: 123-128 |
| 14 | EE | Adrian Dumitrescu,
Sumanta Guha:
Extreme Distances in Multicolored Point Sets.
International Conference on Computational Science (3) 2002: 14-25 |
| 13 | EE | Adrian Dumitrescu,
Géza Tóth:
Ramsey-Type Results for Unions of Comparability Graphs.
Graphs and Combinatorics 18(2): 245-251 (2002) |
| 12 | EE | Adrian Dumitrescu,
János Pach:
Partitioning Colored Point Sets into Monochromatic Parts.
Int. J. Comput. Geometry Appl. 12(5): 401-412 (2002) |
| 2001 |
|---|
| 11 | EE | Adrian Dumitrescu,
Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane.
SODA 2001: 38-46 |
| 10 | EE | Adrian Dumitrescu,
Joseph S. B. Mitchell,
Micha Sharir:
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles.
Symposium on Computational Geometry 2001: 141-150 |
| 9 | EE | Adrian Dumitrescu,
János Pach:
Partitioning Colored Point Sets into Monochromatic Parts.
WADS 2001: 264-275 |
| 8 | | Adrian Dumitrescu,
Rick Kaye:
Matching colored points in the plane: Some new results.
Comput. Geom. 19(1): 69-85 (2001) |
| 7 | | Adrian Dumitrescu,
Bernd Gärtner,
Samuele Pedroni,
Emo Welzl:
Enumerating triangulation paths.
Comput. Geom. 20(1-2): 3-12 (2001) |
| 6 | EE | Adrian Dumitrescu,
William L. Steiger:
Space-time trade-offs for some ranking and searching queries.
Inf. Process. Lett. 79(5): 237-241 (2001) |
| 2000 |
|---|
| 5 | EE | Adrian Dumitrescu,
Bernd Gärtner,
Samuele Pedroni,
Emo Welzl:
Enumerating Triangulation Paths.
CCCG 2000 |
| 4 | EE | Adrian Dumitrescu,
William L. Steiger:
On a matching problem in the plane.
Discrete Mathematics 211: 183-195 (2000) |
| 1999 |
|---|
| 3 | EE | Adrian Dumitrescu:
On two lower bound constructions.
CCCG 1999 |
| 2 | EE | Adrian Dumitrescu,
Géza Tóth:
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.
CCCG 1999 |
| 1998 |
|---|
| 1 | EE | Adrian Dumitrescu:
Planar sets with few empty convex polygons.
CCCG 1998 |
