BibTeX records: Florian Zickfeld

download as .bib file

@article{DBLP:journals/dm/BonsmaZ12,
  author       = {Paul S. Bonsma and
                  Florian Zickfeld},
  title        = {Improved bounds for spanning trees with many leaves},
  journal      = {Discret. Math.},
  volume       = {312},
  number       = {6},
  pages        = {1178--1194},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.disc.2011.11.043},
  doi          = {10.1016/J.DISC.2011.11.043},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BonsmaZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/BonsmaZ11,
  author       = {Paul S. Bonsma and
                  Florian Zickfeld},
  title        = {A 3/2-Approximation Algorithm for Finding Spanning Trees with Many
                  Leaves in Cubic Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {25},
  number       = {4},
  pages        = {1652--1666},
  year         = {2011},
  url          = {https://doi.org/10.1137/100801251},
  doi          = {10.1137/100801251},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/BonsmaZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/FelsnerZ08,
  author       = {Stefan Felsner and
                  Florian Zickfeld},
  title        = {On the Number of Planar Orientations with Prescribed Degrees},
  journal      = {Electron. J. Comb.},
  volume       = {15},
  number       = {1},
  year         = {2008},
  url          = {http://www.combinatorics.org/Volume\_15/Abstracts/v15i1r77.html},
  timestamp    = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/FelsnerZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dcg/FelsnerZ08,
  author       = {Stefan Felsner and
                  Florian Zickfeld},
  title        = {Schnyder Woods and Orthogonal Surfaces},
  journal      = {Discret. Comput. Geom.},
  volume       = {40},
  number       = {1},
  pages        = {103--126},
  year         = {2008},
  url          = {https://doi.org/10.1007/s00454-007-9027-9},
  doi          = {10.1007/S00454-007-9027-9},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/FelsnerZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/latin/BonsmaZ08,
  author       = {Paul S. Bonsma and
                  Florian Zickfeld},
  editor       = {Eduardo Sany Laber and
                  Claudson F. Bornstein and
                  Loana Tito Nogueira and
                  Lu{\'{e}}rbio Faria},
  title        = {Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms},
  booktitle    = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
                  B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4957},
  pages        = {531--543},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-78773-0\_46},
  doi          = {10.1007/978-3-540-78773-0\_46},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/BonsmaZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/BonsmaZ08,
  author       = {Paul S. Bonsma and
                  Florian Zickfeld},
  editor       = {Hajo Broersma and
                  Thomas Erlebach and
                  Tom Friedetzky and
                  Dani{\"{e}}l Paulusma},
  title        = {A 3/2-Approximation Algorithm for Finding Spanning Trees with Many
                  Leaves in Cubic Graphs},
  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        = {66--77},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92248-3\_7},
  doi          = {10.1007/978-3-540-92248-3\_7},
  timestamp    = {Sun, 25 Oct 2020 23:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/BonsmaZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/FelsnerZ07,
  author       = {Stefan Felsner and
                  Florian Zickfeld},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Dieter Kratsch and
                  Haiko M{\"{u}}ller},
  title        = {On the Number of \emph{alpha} -Orientations},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
                  {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4769},
  pages        = {190--201},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-74839-7\_19},
  doi          = {10.1007/978-3-540-74839-7\_19},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/FelsnerZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/YuZ06,
  author       = {Xingxing Yu and
                  Florian Zickfeld},
  title        = {Reducing Haj{\'{o}}s' 4-coloring conjecture to 4-connected graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {96},
  number       = {4},
  pages        = {482--492},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.jctb.2005.10.001},
  doi          = {10.1016/J.JCTB.2005.10.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/YuZ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/gd/FelsnerZ06,
  author       = {Stefan Felsner and
                  Florian Zickfeld},
  editor       = {Michael Kaufmann and
                  Dorothea Wagner},
  title        = {Schnyder Woods and Orthogonal Surfaces},
  booktitle    = {Graph Drawing, 14th International Symposium, {GD} 2006, Karlsruhe,
                  Germany, September 18-20, 2006. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4372},
  pages        = {417--429},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/978-3-540-70904-6\_40},
  doi          = {10.1007/978-3-540-70904-6\_40},
  timestamp    = {Sun, 13 Nov 2022 09:57:32 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/FelsnerZ06.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.