Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Joachim Kneis
@article{DBLP:journals/jct/GanianHK0ORS16,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Are there any good digraph width measures?},
journal = {J. Comb. Theory, Ser. {B}},
volume = {116},
pages = {250--286},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2015.09.001},
doi = {10.1016/J.JCTB.2015.09.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GanianHK0ORS16.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/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}
}
@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}
}
@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/iwpec/GanianHKMORS10,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
editor = {Venkatesh Raman and
Saket Saurabh},
title = {Are There Any Good Digraph Width Measures?},
booktitle = {Parameterized and Exact Computation - 5th International Symposium,
{IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6478},
pages = {135--146},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17493-3\_14},
doi = {10.1007/978-3-642-17493-3\_14},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GanianHKMORS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-1485,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Joachim Kneis and
Daniel Meister and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
title = {Are there any good digraph width measures?},
journal = {CoRR},
volume = {abs/1004.1485},
year = {2010},
url = {http://arxiv.org/abs/1004.1485},
eprinttype = {arXiv},
eprint = {1004.1485},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-1485.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Kneis2009,
author = {Joachim Kneis},
title = {Intuitive algorithms},
school = {{RWTH} Aachen University},
year = {2009},
url = {http://darwin.bth.rwth-aachen.de/opus3/volltexte/2009/2998/},
urn = {urn:nbn:de:hbz:82-opus-29987},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Kneis2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KneisMRR09,
author = {Joachim Kneis and
Daniel M{\"{o}}lle and
Stefan Richter and
Peter Rossmanith},
title = {A Bound on the Pathwidth of Sparse Graphs with Applications to Exact
Algorithms},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {1},
pages = {407--427},
year = {2009},
url = {https://doi.org/10.1137/080715482},
doi = {10.1137/080715482},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KneisMRR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BockenhauerKK09,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Joachim Kneis and
Joachim Kupke},
title = {Approximation hardness of deadline-TSP reoptimization},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2241--2249},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.016},
doi = {10.1016/J.TCS.2009.02.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BockenhauerKK09.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}
}
@article{DBLP:journals/aor/BockenhauerFHKKPW07,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Luca Forlizzi and
Juraj Hromkovic and
Joachim Kneis and
Joachim Kupke and
Guido Proietti and
Peter Widmayer},
title = {On the Approximability of {TSP} on Local Modifications of Optimally
Solved Instances},
journal = {Algorithmic Oper. Res.},
volume = {2},
number = {2},
pages = {83--93},
year = {2007},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/2803},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/BockenhauerFHKKPW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BockenhauerHKK07,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Juraj Hromkovic and
Joachim Kneis and
Joachim Kupke},
title = {The Parameterized Approximability of {TSP} with Deadlines},
journal = {Theory Comput. Syst.},
volume = {41},
number = {3},
pages = {431--444},
year = {2007},
url = {https://doi.org/10.1007/s00224-007-1347-x},
doi = {10.1007/S00224-007-1347-X},
timestamp = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BockenhauerHKK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/KneisMR07,
author = {Joachim Kneis and
Daniel M{\"{o}}lle and
Peter Rossmanith},
editor = {Jan van Leeuwen and
Giuseppe F. Italiano and
Wiebe van der Hoek and
Christoph Meinel and
Harald Sack and
Frantisek Pl{\'{a}}sil},
title = {Partial vs. Complete Domination: t-Dominating Set},
booktitle = {{SOFSEM} 2007: Theory and Practice of Computer Science, 33rd Conference
on Current Trends in Theory and Practice of Computer Science, Harrachov,
Czech Republic, January 20-26, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4362},
pages = {367--376},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-69507-3\_31},
doi = {10.1007/978-3-540-69507-3\_31},
timestamp = {Fri, 21 Oct 2022 16:47:28 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/KneisMR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KneisMRR06,
author = {Joachim Kneis and
Daniel M{\"{o}}lle and
Stefan Richter and
Peter Rossmanith},
title = {Parameterized power domination complexity},
journal = {Inf. Process. Lett.},
volume = {98},
number = {4},
pages = {145--149},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.01.007},
doi = {10.1016/J.IPL.2006.01.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KneisMRR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/BockenhauerFHKKPW06,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Luca Forlizzi and
Juraj Hromkovic and
Joachim Kneis and
Joachim Kupke and
Guido Proietti and
Peter Widmayer},
editor = {Gonzalo Navarro and
Leopoldo E. Bertossi and
Yoshiharu Kohayakawa},
title = {Reusing Optimal {TSP} Solutions for Locally Modified Input Instances},
booktitle = {Fourth {IFIP} International Conference on Theoretical Computer Science
{(TCS} 2006), {IFIP} 19th World Computer Congress, {TC-1} Foundations
of Computer Science, August 23-24, 2006, Santiago, Chile},
series = {{IFIP}},
volume = {209},
pages = {251--270},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-0-387-34735-6\_21},
doi = {10.1007/978-0-387-34735-6\_21},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/ifipTCS/BockenhauerFHKKPW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KneisMRR06,
author = {Joachim Kneis and
Daniel M{\"{o}}lle and
Stefan Richter and
Peter Rossmanith},
editor = {Tetsuo Asano},
title = {Intuitive Algorithms and t-Vertex Cover},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {598--607},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_60},
doi = {10.1007/11940128\_60},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KneisMRR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BockenhauerHKK06,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Juraj Hromkovic and
Joachim Kneis and
Joachim Kupke},
editor = {Lars Arge and
Rusins Freivalds},
title = {On the Approximation Hardness of Some Generalizations of {TSP}},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {184--195},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_19},
doi = {10.1007/11785293\_19},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BockenhauerHKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KneisMRR06,
author = {Joachim Kneis and
Daniel M{\"{o}}lle and
Stefan Richter and
Peter Rossmanith},
editor = {Fedor V. Fomin},
title = {Divide-and-Color},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {58--67},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_6},
doi = {10.1007/11917496\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KneisMRR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KneisMRR05,
author = {Joachim Kneis and
Daniel M{\"{o}}lle and
Stefan Richter and
Peter Rossmanith},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {On the Parameterized Complexity of Exact Satisfiability Problems},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {568--579},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_49},
doi = {10.1007/11549345\_49},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KneisMRR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KneisMRR05,
author = {Joachim Kneis and
Daniel M{\"{o}}lle and
Stefan Richter and
Peter Rossmanith},
editor = {Dieter Kratsch},
title = {Algorithms Based on the Treewidth of Sparse Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {385--396},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_34},
doi = {10.1007/11604686\_34},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KneisMRR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/appt/GerlachK03,
author = {Jens Gerlach and
Joachim Kneis},
editor = {Xingming Zhou and
Stefan J{\"{a}}hnichen and
Ming Xu and
Jiannong Cao},
title = {Generic Programming for Scientific Computing in C++, Java, and C{\#}},
booktitle = {Advanced Parallel Programming Technologies, 5th International Workshop,
{APPT} 2003, Xiamen, China, September 17-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2834},
pages = {301--310},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39425-9\_37},
doi = {10.1007/978-3-540-39425-9\_37},
timestamp = {Tue, 14 Apr 2020 13:23:11 +0200},
biburl = {https://dblp.org/rec/conf/appt/GerlachK03.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.
last updated on 2024-04-25 05:43 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:
