|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 33 occurrences of 21 keywords
|
|
|
Results
Found 54 publication records. Showing 54 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
104 | Christophe Paul, Jan Arne Telle |
New Tools and Simpler Algorithms for Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 379-390, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
66 | Christophe Paul, Andrzej Proskurowski, Jan Arne Telle |
Generation of Graphs with Bounded Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 205-216, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
66 | Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca |
Computing Branchwidth Via Efficient Triangulations and Blocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 374-384, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
66 | Ton Kloks, Jan Kratochvíl, Haiko Müller |
New Branchwidth Territories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings, pp. 173-183, 1999, Springer. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
66 | Hans L. Bodlaender, Dimitrios M. Thilikos |
Constructive Linear Time Algorithms for Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 627-637, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
60 | Illya V. Hicks |
Branchwidth and Branch Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 332-339, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Branchwidth, Graph minors theorem, Branch-decomposition-based algorithm, Tangle, Branch decomposition |
58 | Zhengbing Bian, Qian-Ping Gu |
Computing Branch Decomposition of Large Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings, pp. 87-100, 2008, Springer, 978-3-540-68548-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
computational study, Graph algorithms, planar graphs, algorithm engineering, branch-decomposition |
58 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT using vertex covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 44(7-8), pp. 509-523, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
58 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT Using Vertex Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 396-409, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Richard B. Borie, R. Gary Parker, Craig A. Tovey |
Solving problems on recursively constructed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 41(1), pp. 4:1-4:51, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth |
47 | Frederic Dorn, Jan Arne Telle |
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 386-397, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Athanassios Koutsonas, Dimitrios M. Thilikos |
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 264-274, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
Computational Study on Dominating Set Problem of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 89-102, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
PLANAR DOMINATING SET, computational study, data reduction, fixed-parameter algorithms, branch-decomposition |
38 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(1), pp. 33-47, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph |
38 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 829-844, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
38 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 67-80, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Alessandro Aloisio |
Fixed-Parameter Tractability for Branchwidth of the Maximum-Weight Edge-Colored Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA (6) ![In: Advanced Information Networking and Applications - Proceedings of the 38th International Conference on Advanced Information Networking and Applications (AINA-2024), Kitakyushu, Japan, 17-19 April, 2024, Volume 6, pp. 86-95, 2024, Springer, 978-3-031-57941-7. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
28 | Dimitrios M. Thilikos, Sebastian Wiederrecht |
Approximating branchwidth on parametric extensions of planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.04517, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
28 | Fedor V. Fomin, Tuukka Korhonen |
Fast FPT-approximation of branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 886-899, 2022, ACM, 978-1-4503-9264-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
28 | Fedor V. Fomin, Tuukka Korhonen |
Fast FPT-Approximation of Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.03492, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
28 | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
A SAT Approach to Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 20(3), pp. 15:1-15:24, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
A SAT Approach to Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp. 4894-4898, 2017, ijcai.org, 978-0-9992411-0-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
28 | Fedor V. Fomin, Dimitrios M. Thilikos |
Branchwidth of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2016 Edition, pp. 232-237, 2016, Springer, 978-1-4939-2863-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno |
(Total) Vector domination for graphs with bounded branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 207, pp. 80-89, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
A SAT Approach to Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings, pp. 179-195, 2016, Springer, 978-3-319-40969-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno |
(Total) Vector Domination for Graphs with Bounded Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, pp. 238-249, 2014, Springer, 978-3-642-54422-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
28 | Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno |
(Total) Vector Domination for Graphs with Bounded Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1306.5041, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
28 | J. Cole Smith, Elif Ulusal, Illya V. Hicks |
A combinatorial optimization algorithm for solving the branchwidth problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 51(3), pp. 1211-1229, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
28 | Qian-Ping Gu, Hisao Tamaki |
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 64(3), pp. 416-453, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
28 | Ignasi Sau, Dimitrios M. Thilikos |
On self-duality of branchwidth in graphs of bounded genus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 159(17), pp. 2184-2186, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
28 | Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender |
A Local Search Algorithm for Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, pp. 444-454, 2011, Springer, 978-3-642-18380-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
28 | Qian-Ping Gu, Hisao Tamaki |
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC (2) ![In: Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, pp. 85-96, 2010, Springer, 978-3-642-17513-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
28 | Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca |
Computing branchwidth via efficient triangulations and blocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(12), pp. 2726-2736, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Christophe Paul, Jan Arne Telle |
Branchwidth of chordal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(12), pp. 2718-2725, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Frederic Dorn, Jan Arne Telle |
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(12), pp. 2737-2746, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Christophe Paul, Jan Arne Telle |
Edge-maximal graphs of branchwidth k: The k-branches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(6), pp. 1467-1475, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Ignasi Sau, Dimitrios M. Thilikos |
On Self-Duality of Branchwidth in Graphs of Bounded Genus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTW ![In: Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009, pp. 19-22, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
28 | Fedor V. Fomin, Dimitrios M. Thilikos |
Branchwidth of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2008 Edition, 2008, Springer, 978-0-387-30770-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake |
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008, pp. 152-165, 2008, SIAM, 978-1-61197-288-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Elif Ulusal |
Integer programming models for the branchwidth problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2008 |
RDF |
|
28 | Illya V. Hicks, Nolan B. McMurray Jr. |
The branchwidth of graphs and their cycle matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 97(5), pp. 681-692, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Christophe Paul, Jan Arne Telle |
Edge-maximal graphs of branchwidth k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 22, pp. 363-368, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Ton Kloks, Jan Kratochvíl, Haiko Müller |
Computing the branchwidth of interval graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 145(2), pp. 266-275, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Zsolt Tuza |
Strong branchwidth and local transversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 145(2), pp. 291-296, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Illya V. Hicks |
Graphs, branchwidth, and tangles! Oh my! ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 45(2), pp. 55-60, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Hans L. Bodlaender, Dimitrios M. Thilikos |
Graphs with Branchwidth at Most Three. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 32(2), pp. 167-194, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Qian-Ping Gu, Hisao Tamaki |
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 984-993, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Graph algorithms, graph minors, branch-decompositions |
19 | Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster |
Treewidth Lower Bounds with Brambles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(1), pp. 81-98, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bramble, Grid minor, Approximation algorithm, Lower bound, Planar graph, Treewidth |
19 | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin |
On Problems without Polynomial Kernels (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 563-574, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Frederic Dorn |
Dynamic Programming and Fast Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 280-291, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(6), pp. 866-893, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph |
19 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 830-839, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
19 | Fedor V. Fomin, Dimitrios M. Thilikos |
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 581-592, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
embedded graphs, subexponential algorithms, Dominating set, parameterized algorithms, branch-width |
19 | Henning Fernau, David W. Juedes |
A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 488-499, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #54 of 54 (100 per page; Change: )
|
|