default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrederic Dorn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j11]Frederic Dorn, Fedor V. Fomin
, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. 233: 60-70 (2013)- [j10]Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension and Rural Postman. SIAM J. Discret. Math. 27(1): 75-94 (2013) - 2012
- [j9]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. Algorithmica 64(1): 69-84 (2012) - [j8]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs. J. Comput. Syst. Sci. 78(5): 1606-1622 (2012) - 2011
- [j7]Paul S. Bonsma, Frederic Dorn:
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. ACM Trans. Algorithms 7(4): 44:1-44:19 (2011) - [j6]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50): 7018-7028 (2011) - 2010
- [j5]Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica 58(3): 790-810 (2010) - [j4]Frederic Dorn:
Dynamic programming and planarity: Improved tree-decomposition based algorithms. Discret. Appl. Math. 158(7): 800-808 (2010) - [c13]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Fast Minor Testing in Planar Graphs. ESA (1) 2010: 97-109 - [c12]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS 2010: 251-262 - [c11]Frederic Dorn:
Planar Subgraph Isomorphism Revisited. STACS 2010: 263-274 - [c10]Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Minor Containment. SWAT 2010: 322-333 - [c9]Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension. WG 2010: 100-111 - [i4]Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh:
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. CoRR abs/1001.0821 (2010)
2000 – 2009
- 2009
- [j3]Frederic Dorn, Jan Arne Telle:
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Discret. Appl. Math. 157(12): 2737-2746 (2009) - [i3]Frederic Dorn:
Planar Subgraph Isomorphism Revisited. CoRR abs/0909.4692 (2009) - 2008
- [j2]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Subexponential parameterized algorithms. Comput. Sci. Rev. 2(1): 29-39 (2008) - [c8]Paul S. Bonsma, Frederic Dorn:
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. ESA 2008: 222-233 - [c7]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs. SODA 2008: 631-640 - [i2]Paul S. Bonsma, Frederic Dorn:
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems. CoRR abs/0804.2032 (2008) - 2007
- [c6]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms. ICALP 2007: 15-27 - [c5]Frederic Dorn:
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. WG 2007: 280-291 - [i1]Paul S. Bonsma, Frederic Dorn:
An FPT Algorithm for Directed Spanning k-Leaf. CoRR abs/0711.4052 (2007) - 2006
- [c4]Frederic Dorn:
Dynamic Programming and Fast Matrix Multiplication. ESA 2006: 280-291 - [c3]Frederic Dorn, Jan Arne Telle:
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. LATIN 2006: 386-397 - [c2]Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT 2006: 172-183 - 2005
- [j1]Jochen Alber, Frederic Dorn, Rolf Niedermeier:
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discret. Appl. Math. 145(2): 219-231 (2005) - [c1]Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA 2005: 95-106
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
