Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Alexander Langer

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Alexander Langer

download as .bib file

@article{DBLP:journals/talg/0002LPRRSS16,
  author       = {Eun Jung Kim and
                  Alexander Langer and
                  Christophe Paul and
                  Felix Reidl and
                  Peter Rossmanith and
                  Ignasi Sau and
                  Somnath Sikdar},
  title        = {Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {12},
  number       = {2},
  pages        = {21:1--21:41},
  year         = {2016},
  url          = {https://doi.org/10.1145/2797140},
  doi          = {10.1145/2797140},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/0002LPRRSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/csr/LangerRRS14,
  author       = {Alexander Langer and
                  Felix Reidl and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Practical algorithms for {MSO} model-checking on tree-decomposable
                  graphs},
  journal      = {Comput. Sci. Rev.},
  volume       = {13-14},
  pages        = {39--74},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.cosrev.2014.08.001},
  doi          = {10.1016/J.COSREV.2014.08.001},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/csr/LangerRRS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GanianHKLOR14,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Joachim Kneis and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith},
  title        = {Digraph width measures in parameterized algorithmics},
  journal      = {Discret. Appl. Math.},
  volume       = {168},
  pages        = {88--107},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.dam.2013.10.038},
  doi          = {10.1016/J.DAM.2013.10.038},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GanianHKLOR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/GanianHLORS14,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Lower bounds on the complexity of MSO\({}_{\mbox{1}}\) model-checking},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {80},
  number       = {1},
  pages        = {180--194},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jcss.2013.07.005},
  doi          = {10.1016/J.JCSS.2013.07.005},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/GanianHLORS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/dnb/Langer13,
  author       = {Alexander Langer},
  title        = {Fast algorithms for decomposable graphs},
  school       = {{RWTH} Aachen University},
  year         = {2013},
  url          = {http://darwin.bth.rwth-aachen.de/opus3/volltexte/2013/4531},
  urn          = {urn:nbn:de:hbz:82-opus-45311},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/dnb/Langer13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/0002LPRRSS13,
  author       = {Eun Jung Kim and
                  Alexander Langer and
                  Christophe Paul and
                  Felix Reidl and
                  Peter Rossmanith and
                  Ignasi Sau and
                  Somnath Sikdar},
  editor       = {Fedor V. Fomin and
                  Rusins Freivalds and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions},
  booktitle    = {Automata, Languages, and Programming - 40th International Colloquium,
                  {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7965},
  pages        = {613--624},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39206-1\_52},
  doi          = {10.1007/978-3-642-39206-1\_52},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/0002LPRRSS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:conf/gi/Langer13,
  author       = {Alexander Langer},
  editor       = {Abraham Bernstein and
                  Wolfgang Effelsberg and
                  Steffen H{\"{o}}lldobler and
                  Hans{-}Peter Lenhof and
                  Klaus{-}Peter L{\"{o}}hr and
                  Paul Molitor and
                  Gustaf Neumann and
                  R{\"{u}}diger Reischuk and
                  Nicole Schweikardt and
                  Myra Spiliopoulou and
                  Harald St{\"{o}}rrle and
                  Sabine S{\"{u}}sstrunk},
  title        = {Schnelle Algorithmen f{\"{u}}r zerlegbare Graphen},
  booktitle    = {Ausgezeichnete Informatikdissertationen 2013},
  series       = {{LNI}},
  volume       = {{D-14}},
  pages        = {101--110},
  publisher    = {{GI}},
  year         = {2013},
  url          = {https://dl.gi.de/handle/20.500.12116/33796},
  timestamp    = {Tue, 04 Jul 2023 17:43:38 +0200},
  biburl       = {https://dblp.org/rec/conf/gi/Langer13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/alenex/LangerRRS12,
  author       = {Alexander Langer and
                  Felix Reidl and
                  Peter Rossmanith and
                  Somnath Sikdar},
  editor       = {David A. Bader and
                  Petra Mutzel},
  title        = {Evaluation of an MSO-Solver},
  booktitle    = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
                  Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
                  16, 2012},
  pages        = {55--63},
  publisher    = {{SIAM} / Omnipress},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611972924.5},
  doi          = {10.1137/1.9781611972924.5},
  timestamp    = {Tue, 29 Dec 2020 18:28:33 +0100},
  biburl       = {https://dblp.org/rec/conf/alenex/LangerRRS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/GanianHLOR12,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  editor       = {Christoph D{\"{u}}rr and
                  Thomas Wilke},
  title        = {Lower Bounds on the Complexity of MSO{\_}1 Model-Checking},
  booktitle    = {29th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
  series       = {LIPIcs},
  volume       = {14},
  pages        = {326--337},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2012},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2012.326},
  doi          = {10.4230/LIPICS.STACS.2012.326},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/GanianHLOR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1201-2780,
  author       = {Alexander Langer and
                  Felix Reidl and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Linear Kernels on Graphs Excluding Topological Minors},
  journal      = {CoRR},
  volume       = {abs/1201.2780},
  year         = {2012},
  url          = {http://arxiv.org/abs/1201.2780},
  eprinttype    = {arXiv},
  eprint       = {1201.2780},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1201-2780.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1207-0835,
  author       = {Eun Jung Kim and
                  Alexander Langer and
                  Christophe Paul and
                  Felix Reidl and
                  Peter Rossmanith and
                  Ignasi Sau and
                  Somnath Sikdar},
  title        = {Linear kernels and single-exponential algorithms via protrusion decompositions},
  journal      = {CoRR},
  volume       = {abs/1207.0835},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.0835},
  eprinttype    = {arXiv},
  eprint       = {1207.0835},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-0835.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KneisLR11,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  title        = {A New Algorithm for Finding Trees with Many Leaves},
  journal      = {Algorithmica},
  volume       = {61},
  number       = {4},
  pages        = {882--897},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9454-5},
  doi          = {10.1007/S00453-010-9454-5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KneisLR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/KneisLR11,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  title        = {Courcelle's theorem - {A} game-theoretic approach},
  journal      = {Discret. Optim.},
  volume       = {8},
  number       = {4},
  pages        = {568--594},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.disopt.2011.06.001},
  doi          = {10.1016/J.DISOPT.2011.06.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/KneisLR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/Binkele-RaibleBCFKKLLPRW11,
  author       = {Daniel Binkele{-}Raible and
                  Ljiljana Brankovic and
                  Marek Cygan and
                  Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Marcin Pilipczuk and
                  Peter Rossmanith and
                  Jakub Onufry Wojtaszczyk},
  title        = {Breaking the 2\({}^{\mbox{n}}\)-barrier for Irredundance: Two lines
                  of attack},
  journal      = {J. Discrete Algorithms},
  volume       = {9},
  number       = {3},
  pages        = {214--230},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.jda.2011.03.002},
  doi          = {10.1016/J.JDA.2011.03.002},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/Binkele-RaibleBCFKKLLPRW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FernauKKLLRR11,
  author       = {Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Daniel Raible and
                  Peter Rossmanith},
  title        = {An exact algorithm for the Maximum Leaf Spanning Tree problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {412},
  number       = {45},
  pages        = {6290--6302},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.tcs.2011.07.011},
  doi          = {10.1016/J.TCS.2011.07.011},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FernauKKLLRR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tamc/LangerRS11,
  author       = {Alexander Langer and
                  Peter Rossmanith and
                  Somnath Sikdar},
  editor       = {Mitsunori Ogihara and
                  Jun Tarui},
  title        = {Linear-Time Algorithms for Graphs of Bounded Rankwidth: {A} Fresh
                  Look Using Game Theory - (Extended Abstract)},
  booktitle    = {Theory and Applications of Models of Computation - 8th Annual Conference,
                  {TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6648},
  pages        = {505--516},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20877-5\_49},
  doi          = {10.1007/978-3-642-20877-5\_49},
  timestamp    = {Sun, 25 Oct 2020 23:06:59 +0100},
  biburl       = {https://dblp.org/rec/conf/tamc/LangerRS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1102-0908,
  author       = {Alexander Langer and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Linear-Time Algorithms for Graphs of Bounded Rankwidth: {A} Fresh
                  Look Using Game Theory},
  journal      = {CoRR},
  volume       = {abs/1102.0908},
  year         = {2011},
  url          = {http://arxiv.org/abs/1102.0908},
  eprinttype    = {arXiv},
  eprint       = {1102.0908},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1102-0908.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1104-3905,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  title        = {Courcelle's Theorem - {A} Game-Theoretic Approach},
  journal      = {CoRR},
  volume       = {abs/1104.3905},
  year         = {2011},
  url          = {http://arxiv.org/abs/1104.3905},
  eprinttype    = {arXiv},
  eprint       = {1104.3905},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-3905.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1109-5804,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith and
                  Somnath Sikdar},
  title        = {Lower Bounds on the Complexity of {MSO1} Model-Checking},
  journal      = {CoRR},
  volume       = {abs/1109.5804},
  year         = {2011},
  url          = {http://arxiv.org/abs/1109.5804},
  eprinttype    = {arXiv},
  eprint       = {1109.5804},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1109-5804.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ciac/Binkele-RaibleBFKKLLR10,
  author       = {Daniel Binkele{-}Raible and
                  Ljiljana Brankovic and
                  Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Peter Rossmanith},
  editor       = {Tiziana Calamoneri and
                  Josep D{\'{\i}}az},
  title        = {A Parameterized Route to Exact Puzzles: Breaking the 2\({}^{\mbox{\emph{n}}}\)-Barrier
                  for Irredundance},
  booktitle    = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
                  Rome, Italy, May 26-28, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6078},
  pages        = {311--322},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13073-1\_28},
  doi          = {10.1007/978-3-642-13073-1\_28},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ciac/Binkele-RaibleBFKKLLR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fsttcs/KneisLR09,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  editor       = {Ravi Kannan and
                  K. Narayan Kumar},
  title        = {A Fine-grained Analysis of a Simple Independent Set Algorithm},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
                  {IIT} Kanpur, India},
  series       = {LIPIcs},
  volume       = {4},
  pages        = {287--298},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2009},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2326},
  doi          = {10.4230/LIPICS.FSTTCS.2009.2326},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/KneisLR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwpec/FernauKKLLRR09,
  author       = {Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Daniel Raible and
                  Peter Rossmanith},
  editor       = {Jianer Chen and
                  Fedor V. Fomin},
  title        = {An Exact Algorithm for the Maximum Leaf Spanning Tree Problem},
  booktitle    = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
                  2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5917},
  pages        = {161--172},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11269-0\_13},
  doi          = {10.1007/978-3-642-11269-0\_13},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/FernauKKLLRR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwpec/GanianHKLOR09,
  author       = {Robert Ganian and
                  Petr Hlinen{\'{y}} and
                  Joachim Kneis and
                  Alexander Langer and
                  Jan Obdrz{\'{a}}lek and
                  Peter Rossmanith},
  editor       = {Jianer Chen and
                  Fedor V. Fomin},
  title        = {On Digraph Width Measures in Parameterized Algorithmics},
  booktitle    = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
                  2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5917},
  pages        = {185--197},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11269-0\_15},
  doi          = {10.1007/978-3-642-11269-0\_15},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/GanianHKLOR09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0909-4224,
  author       = {Ljiljana Brankovic and
                  Henning Fernau and
                  Joachim Kneis and
                  Dieter Kratsch and
                  Alexander Langer and
                  Mathieu Liedloff and
                  Daniel Raible and
                  Peter Rossmanith},
  title        = {Breaking the 2{\^{}}n-Barrier for Irredundance: {A} Parameterized
                  Route to Solving Exact Puzzles},
  journal      = {CoRR},
  volume       = {abs/0909.4224},
  year         = {2009},
  url          = {http://arxiv.org/abs/0909.4224},
  eprinttype    = {arXiv},
  eprint       = {0909.4224},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0909-4224.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/KneisLR08,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  editor       = {Seok{-}Hee Hong and
                  Hiroshi Nagamochi and
                  Takuro Fukunaga},
  title        = {A New Algorithm for Finding Trees with Many Leaves},
  booktitle    = {Algorithms and Computation, 19th International Symposium, {ISAAC}
                  2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5369},
  pages        = {270--281},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92182-0\_26},
  doi          = {10.1007/978-3-540-92182-0\_26},
  timestamp    = {Thu, 27 Apr 2023 14:57:19 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/KneisLR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/KneisLR08,
  author       = {Joachim Kneis and
                  Alexander Langer and
                  Peter Rossmanith},
  editor       = {Hajo Broersma and
                  Thomas Erlebach and
                  Tom Friedetzky and
                  Dani{\"{e}}l Paulusma},
  title        = {Improved Upper Bounds for Partial Vertex Cover},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
                  {WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5344},
  pages        = {240--251},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92248-3\_22},
  doi          = {10.1007/978-3-540-92248-3\_22},
  timestamp    = {Sun, 25 Oct 2020 23:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/KneisLR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/entcs/KneisL09,
  author       = {Joachim Kneis and
                  Alexander Langer},
  editor       = {Milan Ceska and
                  Zdenek Kot{\'{a}}sek and
                  Mojm{\'{\i}}r Kret{\'{\i}}nsk{\'{y}} and
                  Ludek Matyska and
                  Tom{\'{a}}s Vojnar},
  title        = {A Practical Approach to Courcelle's Theorem},
  booktitle    = {Proceedings of the International Doctoral Workshop on Mathematical
                  and Engineering Methods in Computer Science, {MEMICS} 2008, Znojmo,
                  Czech Republic, November 14-16, 2008},
  series       = {Electronic Notes in Theoretical Computer Science},
  volume       = {251},
  pages        = {65--81},
  publisher    = {Elsevier},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.entcs.2009.08.028},
  doi          = {10.1016/J.ENTCS.2009.08.028},
  timestamp    = {Thu, 09 Mar 2023 14:59:00 +0100},
  biburl       = {https://dblp.org/rec/journals/entcs/KneisL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

a service of

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.