Adrian Dumitrescu - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Opaque SetsAdrian Dumitrescu, Minghui Jiang, János Pach. approx 2011: 194-205 [doi]

The Forest Hiding ProblemAdrian Dumitrescu, Minghui Jiang. dcg, 45(3):529-552, 2011. [doi]

Sweeping an oval to a vanishing pointAdrian Dumitrescu, Minghui Jiang. DAM, 159(14):1436-1442, 2011. [doi]

New bounds on the average distance from the Fermat-Weber center of a planar convex bodyAdrian Dumitrescu, Minghui Jiang, Csaba D. Tóth. disopt, 8(3):417-427, 2011. [doi]

Constrained k-center and movement to independenceAdrian Dumitrescu, Minghui Jiang. DAM, 159(8):859-865, 2011. [doi]

Sweeping PointsAdrian Dumitrescu, Minghui Jiang. algorithmica, 60(3):703-717, 2011. [doi]

Piercing Translates and Homothets of a Convex BodyAdrian Dumitrescu, Minghui Jiang. algorithmica, 61(1):94-115, 2011. [doi]

Minimum Weight Convex Steiner PartitionsAdrian Dumitrescu, Csaba D. Tóth. algorithmica, 60(3):627-652, 2011. [doi]

Bounds on the maximum multiplicity of some common geometric graphsAdrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth. STACS 2011: 637-648 [doi]

Minimum Clique Partition in Unit Disk GraphsAdrian Dumitrescu, János Pach. gc, 27(3):399-411, 2011. [doi]

2010

On Covering Problems of RadoSergey Bereg, Adrian Dumitrescu, Minghui Jiang. algorithmica, 57(3):538-561, 2010. [doi]

Maximum Area Independent Sets in Disk Intersection GraphsSergey Bereg, Adrian Dumitrescu, Minghui Jiang. ijcga, 20(2):105-118, 2010. [doi]

Dispersion in Unit DisksAdrian Dumitrescu, Minghui Jiang. STACS 2010: 299-310 [doi]

Long Non-crossing Configurations in the PlaneAdrian Dumitrescu, Csaba D. TÃ³th. STACS 2010: 311-322 [doi]

Monochromatic simplices of any volumeAdrian Dumitrescu, Minghui Jiang. DM, 310(4):956-960, 2010. [doi]

The Forest Hiding ProblemAdrian Dumitrescu, Minghui Jiang. soda 2010: 1566-1579 [doi]

Long Non-crossing Configurations in the PlaneAdrian Dumitrescu, Csaba D. Tóth. dcg, 44(4):727-752, 2010. [doi]

Approximate euclidean ramsey theoremsAdrian Dumitrescu. cccg 2010: 131-134 [doi]

Watchman tours for polygons with holesAdrian Dumitrescu, Csaba D. Tóth. cccg 2010: 113-116 [doi]

Constrained k-center and movement to independenceAdrian Dumitrescu, Minghui Jiang. cccg 2010: 233-236 [doi]

Minimum-Perimeter Intersecting PolygonsAdrian Dumitrescu, Minghui Jiang. latin 2010: 433-445 [doi]

Vision-Based Pursuit-Evasion in a GridAdrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski. siamdm, 24(3):1177-1204, 2010. [doi]

2009

Compatible geometric matchingsOswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood. comgeo, 42(6-7):617-626, 2009. [doi]

Traversing a Set of Points with a Minimum Number of TurnsSergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr. dcg, 41(4):513-532, 2009. [doi]

On stars and Steiner stars: IIAdrian Dumitrescu, Csaba D. Tóth, Guangwu Xu. soda 2009: 311-317 [doi]

Light orthogonal networks with constant geometric dilationAdrian Dumitrescu, Csaba D. TÃ³th. jda, 7(1):112-129, 2009. [doi]

Extremal problems on triangle areas in two and three dimensionsAdrian Dumitrescu, Micha Sharir, Csaba D. TÃ³th. JCT, 116(7):1177-1198, 2009. [doi]

New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex BodyAdrian Dumitrescu, Csaba D. TÃ³th. isaac 2009: 132-141 [doi]

On Reconfiguration of Disks in the Plane and Related ProblemsAdrian Dumitrescu, Minghui Jiang. wads 2009: 254-265 [doi]

On stars and Steiner starsAdrian Dumitrescu, Csaba D. Tóth, Guangwu Xu. disopt, 6(3):324-332, 2009. [doi]

Drawing Hamiltonian Cycles with No Large AnglesAdrian Dumitrescu, János Pach, Géza Tóth. gd 2010: 3-14 [doi]

Piercing Translates and Homothets of a Convex BodyAdrian Dumitrescu, Minghui Jiang. esa 2009: 131-142 [doi]

2008

Compatible Geometric MatchingsOswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood. endm, 31:201-206, 2008. [doi]

On Covering Problems of RadoSergey Bereg, Adrian Dumitrescu, Minghui Jiang. swat 2008: 294-305 [doi]

Sliding Disks in the PlaneSergey Bereg, Adrian Dumitrescu, János Pach. ijcga, 18(5):373-387, 2008. [doi]

Reconfigurations in Graphs and GridsGruia Calinescu, Adrian Dumitrescu, János Pach. siamdm, 22(1):124-138, 2008. [doi]

On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-SpaceAdrian Dumitrescu, Csaba D. Tóth. cpc, 17(2):203-224, 2008. [doi]

On distinct distances and lambda-free point setsAdrian Dumitrescu. DM, 308(24):6533-6538, 2008. [doi]

On distinct distances among points in general position and other related problemsAdrian Dumitrescu. cccg 2008:

Offline variants of the lion and man problem: - Some problems and techniques for measuring crowdedness and for safe path planning - Adrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski. TCS, 399(3):220-235, 2008. [doi]

On stars and Steiner starsAdrian Dumitrescu, Csaba D. Tóth. soda 2008: 1233-1240 [doi]

Monochromatic simplices of any volumeAdrian Dumitrescu, Minghui Jiang. cccg 2008:

Sweeping PointsAdrian Dumitrescu, Minghui Jiang. approx 2008: 63-76 [doi]

Extremal problems on triangle areas in two and three dimensionsAdrian Dumitrescu, Micha Sharir, Csaba D. Tóth. compgeom 2008: 208-217 [doi]

Minimum weight convex Steiner partitionsAdrian Dumitrescu, Csaba D. Tóth. soda 2008: 581-590 [doi]

Vision-Based Pursuit-Evasion in a GridAdrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski. swat 2008: 53-64 [doi]

2007

Traversing a set of points with a minimum number of turnsSergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr. compgeom 2007: 46-55 [doi]

Offline variants of the lion and man problemAdrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski. compgeom 2007: 102-111 [doi]

Distinct Triangle Areas in a Planar Point SetAdrian Dumitrescu, Csaba D. Tóth. ipco 2007: 119-129 [doi]

On the number of tetrahedra with minimum, unit, and distinct volumes in three-spaceAdrian Dumitrescu, Csaba D. Tóth. soda 2007: 1114-1123 [doi]

Light Orthogonal Networks with Constant Geometric DilationAdrian Dumitrescu, Csaba D. Tóth. STACS 2007: 175-187 [doi]

Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner TreesAdrian Dumitrescu, Csaba D. Tóth. jucs, 13(11):1615-1627, 2007. [doi]

On the geometric dilation of closed curves, graphs, and point setsAdrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote. comgeo, 36(1):16-38, 2007. [doi]

2006

The Lifting Model for ReconfigurationSergey Bereg, Adrian Dumitrescu. dcg, 35(4):653-669, 2006. [doi]

Reconfigurations in Graphs and GridsGruia Calinescu, Adrian Dumitrescu, János Pach. latin 2006: 262-273 [doi]

On Distinct Distances from a Vertex of a Convex PolygonAdrian Dumitrescu. dcg, 36(4):503-509, 2006. [doi]

Pushing Squares AroundAdrian Dumitrescu, János Pach. gc, 22(1):37-50, 2006. [doi]

2005

On the chromatic number of some geometric type Kneser graphsGabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia. comgeo, 32(1):59-69, 2005. [doi]

The lifting model for reconfigurationSergey Bereg, Adrian Dumitrescu. compgeom 2005: 55-62 [doi]

Separating Points by Axis-parallel LinesGruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan. ijcga, 15(6):575-590, 2005. [doi]

On Geometric Dilation and Halving ChordsAdrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote. wads 2005: 244-255 [doi]

Monotone Paths in Line Arrangements with a Small Number of DirectionsAdrian Dumitrescu. dcg, 33(4):687-697, 2005. [doi]

On some monotone path problems in line arrangementsAdrian Dumitrescu. comgeo, 32(1):13-25, 2005. [doi]

Improved lower bound on the geometric dilation of point setsAdrian Dumitrescu, Ansgar GrÃ¼ne, GÃ¼nter Rote. ewcg 2005: 37-40 [doi]

2004

Sliding Disks in the PlaneSergey Bereg, Adrian Dumitrescu, János Pach. jcdcg 2005: 37-47 [doi]

Separating points by axis-parallel linesGruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan. cccg 2004: 7-10 [doi]

The cost of cutting out convex ::::n::::-gonsAdrian Dumitrescu. DAM, 143(1-3):353-358, 2004. [doi]

Formations for Fast Locomotion of Metamorphic Robotic SystemsAdrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita. ijrr, 23(6):583-593, 2004. [doi]

On some monotone path problems in line arrangementsAdrian Dumitrescu. cccg 2004: 200-203 [doi]

A remark on the Erdös-Szekeres theoremAdrian Dumitrescu. cccg 2004: 2-3 [doi]

On distinct distances from a vertex of a convex polygonAdrian Dumitrescu. compgeom 2004: 57-60 [doi]

On the Fréchet distance of a set of curvesAdrian Dumitrescu, Günter Rote. cccg 2004: 162-165 [doi]

Pushing squares aroundAdrian Dumitrescu, János Pach. compgeom 2004: 116-123 [doi]

An approximation algorithm for cutting out convex polygonsAdrian Dumitrescu. comgeo, 29(3):223-231, 2004. [doi]

Extreme Distances in Multicolored Point SetsAdrian Dumitrescu, Sumanta Guha. jgaa, 8:27-38, 2004. [doi]

Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfigurationAdrian Dumitrescu, Ichiro Suzuki, Masafumi Yamashita. trob, 20(3):409-418, 2004. [doi]

Binary Space Partitions for Axis-Parallel Segments, Rectangles, and HyperrectanglesAdrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir. dcg, 31(2):207-227, 2004. [doi]

2003

Generating Small Combinatorial Test Suites to Cover Input-Output RelationshipsChristine Cheng, Adrian Dumitrescu, Patrick J. Schroeder. qsic 2003: 76-82 [doi]

Efficient Algorithms for Generation of Combinatorial Covering SuitesAdrian Dumitrescu. isaac 2003: 300-308 [doi]

An approximation algorithm for cutting out convex polygonsAdrian Dumitrescu. soda 2003: 823-827 [doi]

Approximation algorithms for TSP with neighborhoods in the planeAdrian Dumitrescu, Joseph S. B. Mitchell. jal, 48(1):135-159, 2003. [doi]

2002

2001

2000

On a matching problem in the planeAdrian Dumitrescu, William L. Steiger. DM, 211:183-195, 2000. [doi]

Enumerating Triangulation PathsAdrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl. cccg 2000: [doi]

1999

On two lower bound constructionsAdrian Dumitrescu. cccg 1999: [doi]

Ramsey-type results for unions of comparability graphs and convex sets inrestricted positionAdrian Dumitrescu, Géza Tóth. cccg 1999: [doi]

1998

Planar sets with few empty convex polygonsAdrian Dumitrescu. cccg 1998: [doi]