Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- Author
- DEMAINE, Erik D1 ; FOMIN, Fedor V2 ; HAJIAGHAYI, Mohammadtaghi1 ; THILIKOS, Dimitrios M3
[1] MIT, Cambridge, Massachusetts, United States
[2] University of Bergen, Bergen, Norway
[3] National and Capodistrian University of Athens, Athens, Greece - Source
Journal of the Association for Computing Machinery. 2005, Vol 52, Num 6, pp 866-893, 28 p ; ref : 2 p.1/4
- CODEN
- JACOAH
- ISSN
- 0004-5411
- Scientific domain
- Computer science
- Publisher
- Association for Computing Machinery, New York, NY
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- (k domination fixed-parameter algorithms map graph planar graph r)-center
- Keyword (fr)
- Appel procédure Borne supérieure Complexité calcul Ensemble dominant Graphe biparti Graphe planaire Largeur arborescente Multigraphe Recouvrement ensemble Recouvrement graphe Théorie graphe
- Keyword (en)
- Procedure call Upper bound Computational complexity Dominating set Bipartite graph Planar graph Treewidth Multigraph Set covering Graph covering Graph theory
- Keyword (es)
- Llamada procedimiento Cota superior Complejidad computación Conjunto dominando Grafo bipartido Grafo planario Anchura arbol Multígrafo Cubierta conjunto Cubierta grafo Teoría grafo
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 17334399
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1145/1101821.1101823 
https://dx.doi.org/10.1145/1101821.1101823
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1101821.1101823\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Journal of the Association for Computing Machinery\";s:9:\"\u0000*\u0000stitle\";s:22:\"J. Assoc. Comput. Mach\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"866\";s:8:\"\u0000*\u0000epage\";s:3:\"893\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-5411\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DEMAINE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Erik D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"FOMIN, Fedor V\";i:1;s:25:\"HAJIAGHAYI, Mohammadtaghi\";i:2;s:21:\"THILIKOS, Dimitrios M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JACOAH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"28\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1101821.1101823\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Journal of the Association for Computing Machinery\";s:9:\"\u0000*\u0000stitle\";s:22:\"J. Assoc. Comput. Mach\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"866\";s:8:\"\u0000*\u0000epage\";s:3:\"893\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-5411\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DEMAINE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Erik D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"FOMIN, Fedor V\";i:1;s:25:\"HAJIAGHAYI, Mohammadtaghi\";i:2;s:21:\"THILIKOS, Dimitrios M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JACOAH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"28\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1101821.1101823\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1101821.1101823\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Journal of the Association for Computing Machinery\";s:9:\"\u0000*\u0000stitle\";s:22:\"J. Assoc. Comput. Mach\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"866\";s:8:\"\u0000*\u0000epage\";s:3:\"893\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-5411\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DEMAINE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Erik D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"FOMIN, Fedor V\";i:1;s:25:\"HAJIAGHAYI, Mohammadtaghi\";i:2;s:21:\"THILIKOS, Dimitrios M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JACOAH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"28\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1101821.1101823\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Journal of the Association for Computing Machinery\";s:9:\"\u0000*\u0000stitle\";s:22:\"J. Assoc. Comput. Mach\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"866\";s:8:\"\u0000*\u0000epage\";s:3:\"893\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-5411\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DEMAINE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Erik D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"FOMIN, Fedor V\";i:1;s:25:\"HAJIAGHAYI, Mohammadtaghi\";i:2;s:21:\"THILIKOS, Dimitrios M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JACOAH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"28\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:23:\"10.1145\/1101821.1101823\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:9:\"\u0000*\u0000jtitle\";s:50:\"Journal of the Association for Computing Machinery\";s:9:\"\u0000*\u0000stitle\";s:22:\"J. Assoc. Comput. Mach\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"52\";s:8:\"\u0000*\u0000issue\";s:1:\"6\";s:8:\"\u0000*\u0000spage\";s:3:\"866\";s:8:\"\u0000*\u0000epage\";s:3:\"893\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-5411\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"DEMAINE\";s:10:\"\u0000*\u0000aufirst\";s:6:\"Erik D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:14:\"FOMIN, Fedor V\";i:1;s:25:\"HAJIAGHAYI, Mohammadtaghi\";i:2;s:21:\"THILIKOS, Dimitrios M\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JACOAH\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:87:\"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"28\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
