|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 25 publication records. Showing 25 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos |
Fast Minor Testing in Planar Graphs.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos |
Faster parameterized algorithms for minor containment. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma, Frederic Dorn |
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin |
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Frederic Dorn |
Dynamic programming and planarity: Improved tree-decomposition based algorithms. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
Efficient Algorithms for Eulerian Extension. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos |
Fast Minor Testing in Planar Graphs. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn |
Planar Subgraph Isomorphism Revisited. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos |
Faster Parameterized Algorithms for Minor Containment. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn |
Planar Subgraph Isomorphism Revisited |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frederic Dorn, Jan Arne Telle |
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
Subexponential parameterized algorithms. |
Computer Science Review |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul S. Bonsma, Frederic Dorn |
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Paul S. Bonsma, Frederic Dorn |
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
Catalan structures and dynamic programming in H-minor-free graphs. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul S. Bonsma, Frederic Dorn |
An FPT Algorithm for Directed Spanning k-Leaf |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Frederic Dorn |
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
Subexponential Parameterized Algorithms. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn |
Dynamic Programming and Fast Matrix Multiplication. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Jan Arne Telle |
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Alber, Frederic Dorn, Rolf Niedermeier |
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin |
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #25 of 25 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")