Exploració per autor "Demaine, Erik D."
Ara es mostren els items 1-8 de 8
-
1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor
Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Thilikos Touloupas, Dimitrios (2002-05)
Report de recerca
Accés obertWe give polynomial-time constant-factor approximation algorithms for the treewidth and branchwidth of any H-minor-free graph for a given graph H with crossing number at most 1. The approximation factors are 1.5 for ... -
Bidimensional parameters and local treewidth
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos Touloupas, Dimitrios (2003-10)
Report de recerca
Accés obertFor several graph theoretic parameters such as vertex cover and dominating set, it is known that if their values are bounded by k then the treewidth of the graph is bounded by some function of k. This fact is used as the ... -
Exponential speedup of fixed parameter algorithms on K_{3,3}-minor-free or K_{5}-minor-free graphs
Hajiaghayi, Mohammad Taghi; Demaine, Erik D.; Thilikos Touloupas, Dimitrios (2002-03)
Report de recerca
Accés obertWe present a fixed parameter algorithm that constructively solves the k-dominating set problem on graphs excluding one of the K_{5} or K_3,3 as a minor in time O(3^{6sqrt{34 k}}n^{O(1)}). In fact, we present our ... -
Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos Touloupas, Dimitrios (2003-09)
Report de recerca
Accés obertThe (k,r)-center problem} asks whether an input graph G has atr most k vertices (called centers) such that every vertex of $ is within distance at most r from some center. In this paper we prove that the (k,r)-center ... -
Matching points with things
Taslakian, Perouz; Seara Ojea, Carlos; Saumell Mendiola, Maria; Langerman, Stefan; Hurtado Díaz, Fernando Alfredo; Aloupis, Greg; Cardinal, Jean; Collette, Sébastien; Demaine, Erik D.; Demaine, Martin L.; Dulieu, Muriel; Fabila Monroy, Ruy; Hart, Vi (Springer Verlag, 2010)
Text en actes de congrés
Accés restringit per política de l'editorialGiven an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to ... -
Necklaces, convolutions, and X plus Y
Bremner, David; Chan, Timothy M.; Demaine, Erik D.; Erickson, Jeff; Hurtado Díaz, Fernando Alfredo; Iacono, John; Langerman, Stefan; Patrascu, Mihai; Taslakian, Perouz (2014-06-01)
Article
Accés restringit per política de l'editorialWe give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the ℓ p ... -
Realistic reconfiguration of crystalline (and telecube) robots
Wuhrer, Stefanie; Sacristán Adinolfi, Vera; Ramaswami, Suneeta; Pinciu, Val; Aloupis, Greg; Collette, Sébastien; Damian, Mirela; Demaine, Erik D.; El-Khechen, Dania; Flatland, Robin; Langerman, Stefan; O'Rourke, Joseph (CIMAT, 2008)
Text en actes de congrés
Accés obertIn this paper we propose novel algorithms for reconfiguring modular robots that are composed of n atoms. Each atom has the shape of a unit cube and can expand/contract each face by half a unit, as well as attach to or ... -
Reconfiguration of cube-style modular robots using O(logn) parallel moves
Aloupis, Greg; Collette, Sébastien; Demaine, Erik D.; Langerman, Stefan; Sacristán Adinolfi, Vera; Wuhrer, Stefanie (Lecture Notes in Computer Science LNCS 5369, Springer-Verlag, 2008)
Text en actes de congrés
Accés restringit per política de l'editorialWe consider a model of reconfigurable robot, introduced and prototyped by the robotics community. The robot consists of independently manipulable unit-square atoms that can extend/contract arms on each side and attach/detach ...