BibTeX records: Johannes Uhlmann

download as .bib file

@article{DBLP:journals/algorithmica/KomusiewiczU14,
  author       = {Christian Komusiewicz and
                  Johannes Uhlmann},
  title        = {A Cubic-Vertex Kernel for Flip Consensus Tree},
  journal      = {Algorithmica},
  volume       = {68},
  number       = {1},
  pages        = {81--108},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00453-012-9663-1},
  doi          = {10.1007/S00453-012-9663-1},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KomusiewiczU14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BetzlerBBNU14,
  author       = {Nadja Betzler and
                  Hans L. Bodlaender and
                  Robert Bredereck and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion},
  journal      = {Algorithmica},
  volume       = {68},
  number       = {3},
  pages        = {715--738},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00453-012-9695-6},
  doi          = {10.1007/S00453-012-9695-6},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BetzlerBBNU14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BetzlerSU14,
  author       = {Nadja Betzler and
                  Arkadii Slinko and
                  Johannes Uhlmann},
  title        = {On the Computation of Fully Proportional Representation},
  journal      = {CoRR},
  volume       = {abs/1402.0580},
  year         = {2014},
  url          = {http://arxiv.org/abs/1402.0580},
  eprinttype    = {arXiv},
  eprint       = {1402.0580},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BetzlerSU14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jair/BetzlerSU13,
  author       = {Nadja Betzler and
                  Arkadii Slinko and
                  Johannes Uhlmann},
  title        = {On the Computation of Fully Proportional Representation},
  journal      = {J. Artif. Intell. Res.},
  volume       = {47},
  pages        = {475--519},
  year         = {2013},
  url          = {https://doi.org/10.1613/jair.3896},
  doi          = {10.1613/JAIR.3896},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jair/BetzlerSU13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/snam/NichterleinNUW13,
  author       = {Andr{\'{e}} Nichterlein and
                  Rolf Niedermeier and
                  Johannes Uhlmann and
                  Mathias Weller},
  title        = {On tractable cases of Target Set Selection},
  journal      = {Soc. Netw. Anal. Min.},
  volume       = {3},
  number       = {2},
  pages        = {233--256},
  year         = {2013},
  url          = {https://doi.org/10.1007/s13278-012-0067-7},
  doi          = {10.1007/S13278-012-0067-7},
  timestamp    = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/snam/NichterleinNUW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/UhlmannW13,
  author       = {Johannes Uhlmann and
                  Mathias Weller},
  title        = {Two-Layer Planarization parameterized by feedback edge set},
  journal      = {Theor. Comput. Sci.},
  volume       = {494},
  pages        = {99--111},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.tcs.2013.01.029},
  doi          = {10.1016/J.TCS.2013.01.029},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/UhlmannW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BetzlerBNU12,
  author       = {Nadja Betzler and
                  Robert Bredereck and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {On Bounded-Degree Vertex Deletion parameterized by treewidth},
  journal      = {Discret. Appl. Math.},
  volume       = {160},
  number       = {1-2},
  pages        = {53--60},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.dam.2011.08.013},
  doi          = {10.1016/J.DAM.2011.08.013},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BetzlerBNU12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KomusiewiczU12,
  author       = {Christian Komusiewicz and
                  Johannes Uhlmann},
  title        = {Cluster editing with locally bounded modifications},
  journal      = {Discret. Appl. Math.},
  volume       = {160},
  number       = {15},
  pages        = {2259--2270},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.dam.2012.05.019},
  doi          = {10.1016/J.DAM.2012.05.019},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KomusiewiczU12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/WellerKNU12,
  author       = {Mathias Weller and
                  Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {On making directed graphs transitive},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {78},
  number       = {2},
  pages        = {559--574},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jcss.2011.07.001},
  doi          = {10.1016/J.JCSS.2011.07.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/WellerKNU12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cpm/BrucknerHKNTU12,
  author       = {Sharon Bruckner and
                  Falk H{\"{u}}ffner and
                  Christian Komusiewicz and
                  Rolf Niedermeier and
                  Sven Thiel and
                  Johannes Uhlmann},
  editor       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Jens Stoye},
  title        = {Partitioning into Colorful Components by Minimum Edge Deletions},
  booktitle    = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
                  Helsinki, Finland, July 3-5, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7354},
  pages        = {56--69},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31265-6\_5},
  doi          = {10.1007/978-3-642-31265-6\_5},
  timestamp    = {Tue, 21 Mar 2023 21:02:12 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/BrucknerHKNTU12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/de/Uhlmann2011,
  author       = {Johannes Uhlmann},
  title        = {Multivariate Algorithmics in Biological Data Analysis},
  school       = {Berlin Institute of Technology},
  year         = {2011},
  url          = {http://opus.kobv.de/tuberlin/volltexte/2011/3152/},
  urn          = {urn:nbn:de:kobv:83-opus-31525},
  isbn         = {978-3-7983-2352-0},
  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/de/Uhlmann2011.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/GuoKKU11,
  author       = {Jiong Guo and
                  Iyad A. Kanj and
                  Christian Komusiewicz and
                  Johannes Uhlmann},
  title        = {Editing Graphs into Disjoint Unions of Dense Clusters},
  journal      = {Algorithmica},
  volume       = {61},
  number       = {4},
  pages        = {949--970},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-011-9487-4},
  doi          = {10.1007/S00453-011-9487-4},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GuoKKU11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/almob/DornHKNU11,
  author       = {Britta Dorn and
                  Falk H{\"{u}}ffner and
                  Dominikus Kr{\"{u}}ger and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {Exploiting bounded signal flow for graph orientation based on cause-effect
                  pairs},
  journal      = {Algorithms Mol. Biol.},
  volume       = {6},
  pages        = {21},
  year         = {2011},
  url          = {https://doi.org/10.1186/1748-7188-6-21},
  doi          = {10.1186/1748-7188-6-21},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/almob/DornHKNU11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/FellowsGKNU11,
  author       = {Michael R. Fellows and
                  Jiong Guo and
                  Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {Graph-based data clustering with overlaps},
  journal      = {Discret. Optim.},
  volume       = {8},
  number       = {1},
  pages        = {2--17},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.disopt.2010.09.006},
  doi          = {10.1016/J.DISOPT.2010.09.006},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/FellowsGKNU11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jda/KomusiewiczNU11,
  author       = {Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {Deconstructing intractability - {A} multivariate complexity analysis
                  of interval constrained coloring},
  journal      = {J. Discrete Algorithms},
  volume       = {9},
  number       = {1},
  pages        = {137--151},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.jda.2010.07.003},
  doi          = {10.1016/J.JDA.2010.07.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/KomusiewiczNU11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sofsem/BetzlerBNU11,
  author       = {Nadja Betzler and
                  Robert Bredereck and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Ivana Cern{\'{a}} and
                  Tibor Gyim{\'{o}}thy and
                  Juraj Hromkovic and
                  Keith G. Jeffery and
                  Rastislav Kr{\'{a}}lovic and
                  Marko Vukolic and
                  Stefan Wolf},
  title        = {On Making a Distinguished Vertex Minimum Degree by Vertex Deletion},
  booktitle    = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
                  on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
                  Smokovec, Slovakia, January 22-28, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6543},
  pages        = {123--134},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-18381-2\_10},
  doi          = {10.1007/978-3-642-18381-2\_10},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/BetzlerBNU11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sofsem/KomusiewiczU11,
  author       = {Christian Komusiewicz and
                  Johannes Uhlmann},
  editor       = {Ivana Cern{\'{a}} and
                  Tibor Gyim{\'{o}}thy and
                  Juraj Hromkovic and
                  Keith G. Jeffery and
                  Rastislav Kr{\'{a}}lovic and
                  Marko Vukolic and
                  Stefan Wolf},
  title        = {Alternative Parameterizations for Cluster Editing},
  booktitle    = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
                  on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
                  Smokovec, Slovakia, January 22-28, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6543},
  pages        = {344--355},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-18381-2\_29},
  doi          = {10.1007/978-3-642-18381-2\_29},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/KomusiewiczU11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tapas/DornHKNU11,
  author       = {Britta Dorn and
                  Falk H{\"{u}}ffner and
                  Dominikus Kr{\"{u}}ger and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Alberto Marchetti{-}Spaccamela and
                  Michael Segal},
  title        = {Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect
                  Pairs},
  booktitle    = {Theory and Practice of Algorithms in (Computer) Systems - First International
                  {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6595},
  pages        = {104--115},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-19754-3\_12},
  doi          = {10.1007/978-3-642-19754-3\_12},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tapas/DornHKNU11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/GuoU10,
  author       = {Jiong Guo and
                  Johannes Uhlmann},
  title        = {Kernelization and complexity results for connectivity augmentation
                  problems},
  journal      = {Networks},
  volume       = {56},
  number       = {2},
  pages        = {131--142},
  year         = {2010},
  url          = {https://doi.org/10.1002/net.20354},
  doi          = {10.1002/NET.20354},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GuoU10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/GuoKNU10,
  author       = {Jiong Guo and
                  Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster
                  Editing},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {24},
  number       = {4},
  pages        = {1662--1683},
  year         = {2010},
  url          = {https://doi.org/10.1137/090767285},
  doi          = {10.1137/090767285},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/GuoKNU10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/aaai/HartungGKNU10,
  author       = {Sepp Hartung and
                  Jiong Guo and
                  Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Maria Fox and
                  David Poole},
  title        = {Exact Algorithms and Experiments for Hierarchical Tree Clustering},
  booktitle    = {Proceedings of the Twenty-Fourth {AAAI} Conference on Artificial Intelligence,
                  {AAAI} 2010, Atlanta, Georgia, USA, July 11-15, 2010},
  pages        = {457--462},
  publisher    = {{AAAI} Press},
  year         = {2010},
  url          = {https://doi.org/10.1609/aaai.v24i1.7684},
  doi          = {10.1609/AAAI.V24I1.7684},
  timestamp    = {Mon, 04 Sep 2023 16:23:45 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/HartungGKNU10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cpm/FleischerGNUWWW10,
  author       = {Rudolf Fleischer and
                  Jiong Guo and
                  Rolf Niedermeier and
                  Johannes Uhlmann and
                  Yihui Wang and
                  Mathias Weller and
                  Xi Wu},
  editor       = {Amihood Amir and
                  Laxmi Parida},
  title        = {Extended Islands of Tractability for Parsimony Haplotyping},
  booktitle    = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
                  New York, NY, USA, June 21-23, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6129},
  pages        = {214--226},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13509-5\_20},
  doi          = {10.1007/978-3-642-13509-5\_20},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/FleischerGNUWWW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/NichterleinNUW10,
  author       = {Andr{\'{e}} Nichterlein and
                  Rolf Niedermeier and
                  Johannes Uhlmann and
                  Mathias Weller},
  editor       = {Otfried Cheong and
                  Kyung{-}Yong Chwa and
                  Kunsoo Park},
  title        = {On Tractable Cases of Target Set Selection},
  booktitle    = {Algorithms and Computation - 21st International Symposium, {ISAAC}
                  2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6506},
  pages        = {378--389},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17517-6\_34},
  doi          = {10.1007/978-3-642-17517-6\_34},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/NichterleinNUW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tamc/UhlmannW10,
  author       = {Johannes Uhlmann and
                  Mathias Weller},
  editor       = {Jan Kratochv{\'{\i}}l and
                  Angsheng Li and
                  Jir{\'{\i}} Fiala and
                  Petr Kolman},
  title        = {Two-Layer Planarization Parameterized by Feedback Edge Set},
  booktitle    = {Theory and Applications of Models of Computation, 7th Annual Conference,
                  {TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6108},
  pages        = {431--442},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13562-0\_39},
  doi          = {10.1007/978-3-642-13562-0\_39},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/UhlmannW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BetzlerU09,
  author       = {Nadja Betzler and
                  Johannes Uhlmann},
  title        = {Parameterized complexity of candidate control in elections and related
                  digraph problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {52},
  pages        = {5425--5442},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2009.05.029},
  doi          = {10.1016/J.TCS.2009.05.029},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BetzlerU09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/aaim/GuoKNU09,
  author       = {Jiong Guo and
                  Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Andrew V. Goldberg and
                  Yunhong Zhou},
  title        = {A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing},
  booktitle    = {Algorithmic Aspects in Information and Management, 5th International
                  Conference, {AAIM} 2009, San Francisco, CA, USA, June 15-17, 2009.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5564},
  pages        = {226--239},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02158-9\_20},
  doi          = {10.1007/978-3-642-02158-9\_20},
  timestamp    = {Tue, 14 May 2019 10:00:41 +0200},
  biburl       = {https://dblp.org/rec/conf/aaim/GuoKNU09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoon/FellowsGKNU09,
  author       = {Michael R. Fellows and
                  Jiong Guo and
                  Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Hung Q. Ngo},
  title        = {Graph-Based Data Clustering with Overlaps},
  booktitle    = {Computing and Combinatorics, 15th Annual International Conference,
                  {COCOON} 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5609},
  pages        = {516--526},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02882-3\_51},
  doi          = {10.1007/978-3-642-02882-3\_51},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/FellowsGKNU09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cpm/KomusiewiczNU09,
  author       = {Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Gregory Kucherov and
                  Esko Ukkonen},
  title        = {Deconstructing Intractability: {A} Case Study for Interval Constrained
                  Coloring},
  booktitle    = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
                  Lille, France, June 22-24, 2009, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5577},
  pages        = {207--220},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02441-2\_19},
  doi          = {10.1007/978-3-642-02441-2\_19},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/KomusiewiczNU09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/GuoKKU09,
  author       = {Jiong Guo and
                  Iyad A. Kanj and
                  Christian Komusiewicz and
                  Johannes Uhlmann},
  editor       = {Yingfei Dong and
                  Ding{-}Zhu Du and
                  Oscar H. Ibarra},
  title        = {Editing Graphs into Disjoint Unions of Dense Clusters},
  booktitle    = {Algorithms and Computation, 20th International Symposium, {ISAAC}
                  2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5878},
  pages        = {583--593},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10631-6\_60},
  doi          = {10.1007/978-3-642-10631-6\_60},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/GuoKKU09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wads/WellerKNU09,
  author       = {Mathias Weller and
                  Christian Komusiewicz and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Frank K. H. A. Dehne and
                  Marina L. Gavrilova and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Csaba D. T{\'{o}}th},
  title        = {On Making Directed Graphs Transitive},
  booktitle    = {Algorithms and Data Structures, 11th International Symposium, {WADS}
                  2009, Banff, Canada, August 21-23, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5664},
  pages        = {542--553},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03367-4\_47},
  doi          = {10.1007/978-3-642-03367-4\_47},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/WellerKNU09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eor/GuoHKNU08,
  author       = {Jiong Guo and
                  Falk H{\"{u}}ffner and
                  Erhan Kenar and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {Complexity and exact algorithms for vertex multicut in interval and
                  bounded treewidth graphs},
  journal      = {Eur. J. Oper. Res.},
  volume       = {186},
  number       = {2},
  pages        = {542--553},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.ejor.2007.02.014},
  doi          = {10.1016/J.EJOR.2007.02.014},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eor/GuoHKNU08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/GuoNU08,
  author       = {Jiong Guo and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {Two fixed-parameter algorithms for Vertex Covering by Paths on Trees},
  journal      = {Inf. Process. Lett.},
  volume       = {106},
  number       = {2},
  pages        = {81--86},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.ipl.2007.10.007},
  doi          = {10.1016/J.IPL.2007.10.007},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GuoNU08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoa/BetzlerU08,
  author       = {Nadja Betzler and
                  Johannes Uhlmann},
  editor       = {Boting Yang and
                  Ding{-}Zhu Du and
                  Cao An Wang},
  title        = {Parameterized Complexity of Candidate Control in Elections and Related
                  Digraph Problems},
  booktitle    = {Combinatorial Optimization and Applications, Second International
                  Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5165},
  pages        = {43--53},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-85097-7\_5},
  doi          = {10.1007/978-3-540-85097-7\_5},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoa/BetzlerU08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fsttcs/KomusiewiczU08,
  author       = {Christian Komusiewicz and
                  Johannes Uhlmann},
  editor       = {Ramesh Hariharan and
                  Madhavan Mukund and
                  V. Vinay},
  title        = {A Cubic-Vertex Kernel for Flip Consensus Tree},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
                  Bangalore, India},
  series       = {LIPIcs},
  volume       = {2},
  pages        = {280--291},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2008},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1760},
  doi          = {10.4230/LIPICS.FSTTCS.2008.1760},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/KomusiewiczU08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wads/GuoU07,
  author       = {Jiong Guo and
                  Johannes Uhlmann},
  editor       = {Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Norbert Zeh},
  title        = {Kernelization and Complexity Results for Connectivity Augmentation
                  Problems},
  booktitle    = {Algorithms and Data Structures, 10th International Workshop, {WADS}
                  2007, Halifax, Canada, August 15-17, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4619},
  pages        = {483--494},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-73951-7\_42},
  doi          = {10.1007/978-3-540-73951-7\_42},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/GuoU07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BetzlerNU06,
  author       = {Nadja Betzler and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {Tree decompositions of graphs: Saving memory in dynamic programming},
  journal      = {Discret. Optim.},
  volume       = {3},
  number       = {3},
  pages        = {220--229},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disopt.2006.05.008},
  doi          = {10.1016/J.DISOPT.2006.05.008},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BetzlerNU06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sofsem/GuoHKNU06,
  author       = {Jiong Guo and
                  Falk H{\"{u}}ffner and
                  Erhan Kenar and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Jir{\'{\i}} Wiedermann and
                  Gerard Tel and
                  Jaroslav Pokorn{\'{y}} and
                  M{\'{a}}ria Bielikov{\'{a}} and
                  Julius Stuller},
  title        = {Complexity and Exact Algorithms for Multicut},
  booktitle    = {{SOFSEM} 2006: Theory and Practice of Computer Science, 32nd Conference
                  on Current Trends in Theory and Practice of Computer Science, Mer{\'{\i}}n,
                  Czech Republic, January 21-27, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3831},
  pages        = {303--312},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11611257\_28},
  doi          = {10.1007/11611257\_28},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/GuoHKNU06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/endm/BetzlerNU04,
  author       = {Nadja Betzler and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  title        = {Tree Decompositions of Graphs: Saving Memory in Dynamic Programming},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {17},
  pages        = {57--62},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.endm.2004.03.023},
  doi          = {10.1016/J.ENDM.2004.03.023},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/BetzlerNU04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/colognetwente/BetzlerNU04,
  author       = {Nadja Betzler and
                  Rolf Niedermeier and
                  Johannes Uhlmann},
  editor       = {Leo Liberti and
                  Francesco Maffioli},
  title        = {Tree Decompositions of Graphs: Saving Memory in Dynamic Programming},
  booktitle    = {{CTW04} Workshop on Graphs and Combinatorial Optimization, Scientific
                  Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June
                  2004},
  pages        = {56--60},
  year         = {2004},
  timestamp    = {Tue, 09 Nov 2010 19:23:16 +0100},
  biburl       = {https://dblp.org/rec/conf/colognetwente/BetzlerNU04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.