default search action
Alexander Langer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j8]Eun Jung Kim, Alexander Langer, Christophe Paul
, Felix Reidl
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms 12(2): 21:1-21:41 (2016) - 2014
- [j7]Alexander Langer, Felix Reidl
Practical algorithms for MSO model-checking on tree-decomposable graphs. Comput. Sci. Rev. 13-14: 39-74 (2014) - [j6]Robert Ganian
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168: 88-107 (2014) - [j5]Robert Ganian
Lower bounds on the complexity of MSO1 model-checking. J. Comput. Syst. Sci. 80(1): 180-194 (2014) - 2013
- [b1]Alexander Langer:
Fast algorithms for decomposable graphs. RWTH Aachen University, 2013 - [c11]Eun Jung Kim, Alexander Langer, Christophe Paul
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) 2013: 613-624 - [p1]Alexander Langer:
Schnelle Algorithmen für zerlegbare Graphen. Ausgezeichnete Informatikdissertationen 2013: 101-110 - 2012
- [c10]Alexander Langer, Felix Reidl
Evaluation of an MSO-Solver. ALENEX 2012: 55-63 - [c9]Robert Ganian
Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS 2012: 326-337 - [i6]Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Linear Kernels on Graphs Excluding Topological Minors. CoRR abs/1201.2780 (2012) - [i5]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau
Linear kernels and single-exponential algorithms via protrusion decompositions. CoRR abs/1207.0835 (2012) - 2011
- [j4]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A New Algorithm for Finding Trees with Many Leaves. Algorithmica 61(4): 882-897 (2011) - [j3]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Courcelle's theorem - A game-theoretic approach. Discret. Optim. 8(4): 568-594 (2011) - [j2]Daniel Binkele-Raible, Ljiljana Brankovic
Breaking the 2n-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011) - [j1]Henning Fernau
An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412(45): 6290-6302 (2011) - [c8]Alexander Langer, Peter Rossmanith, Somnath Sikdar:
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). TAMC 2011: 505-516 - [i4]Alexander Langer, Peter Rossmanith, Somnath Sikdar:
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory. CoRR abs/1102.0908 (2011) - [i3]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Courcelle's Theorem - A Game-Theoretic Approach. CoRR abs/1104.3905 (2011) - [i2]Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Lower Bounds on the Complexity of MSO1 Model-Checking. CoRR abs/1109.5804 (2011) - 2010
- [c7]Daniel Binkele-Raible, Ljiljana Brankovic
A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. CIAC 2010: 311-322
2000 – 2009
- 2009
- [c6]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A Fine-grained Analysis of a Simple Independent Set Algorithm. FSTTCS 2009: 287-298 - [c5]Henning Fernau
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC 2009: 161-172 - [c4]Robert Ganian
On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197 - [i1]Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith:
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles. CoRR abs/0909.4224 (2009) - 2008
- [c3]Joachim Kneis, Alexander Langer, Peter Rossmanith:
A New Algorithm for Finding Trees with Many Leaves. ISAAC 2008: 270-281 - [c2]Joachim Kneis, Alexander Langer, Peter Rossmanith:
Improved Upper Bounds for Partial Vertex Cover. WG 2008: 240-251 - [c1]Joachim Kneis, Alexander Langer:
A Practical Approach to Courcelle's Theorem. MEMICS 2008: 65-81
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-25 05:42 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: