BibTeX records: Arne Leitert

download as .bib file

@article{DBLP:journals/gc/GuarneraDL22,
  author       = {Heather M. Guarnera and
                  Feodor F. Dragan and
                  Arne Leitert},
  title        = {Injective Hulls of Various Graph Classes},
  journal      = {Graphs Comb.},
  volume       = {38},
  number       = {4},
  pages        = {112},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00373-022-02512-z},
  doi          = {10.1007/S00373-022-02512-Z},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/GuarneraDL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wads/Leitert21,
  author       = {Arne Leitert},
  editor       = {Anna Lubiw and
                  Mohammad R. Salavatipour},
  title        = {Computing the Union Join and Subset Graph of Acyclic Hypergraphs in
                  Subquadratic Time},
  booktitle    = {Algorithms and Data Structures - 17th International Symposium, {WADS}
                  2021, Virtual Event, August 9-11, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12808},
  pages        = {571--584},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-83508-8\_41},
  doi          = {10.1007/978-3-030-83508-8\_41},
  timestamp    = {Fri, 06 Aug 2021 11:47:24 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/Leitert21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2104-06636,
  author       = {Arne Leitert},
  title        = {Computing the Union Join and Subset Graph of Acyclic Hypergraphs in
                  Subquadratic Time},
  journal      = {CoRR},
  volume       = {abs/2104.06636},
  year         = {2021},
  url          = {https://arxiv.org/abs/2104.06636},
  eprinttype    = {arXiv},
  eprint       = {2104.06636},
  timestamp    = {Mon, 19 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-06636.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2007-14377,
  author       = {Heather M. Guarnera and
                  Feodor F. Dragan and
                  Arne Leitert},
  title        = {Injective hulls of various graph classes},
  journal      = {CoRR},
  volume       = {abs/2007.14377},
  year         = {2020},
  url          = {https://arxiv.org/abs/2007.14377},
  eprinttype    = {arXiv},
  eprint       = {2007.14377},
  timestamp    = {Mon, 03 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2007-14377.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/DucoffeL19,
  author       = {Guillaume Ducoffe and
                  Arne Leitert},
  title        = {Equivalence between pathbreadth and strong pathbreadth},
  journal      = {Discret. Appl. Math.},
  volume       = {262},
  pages        = {185--188},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.dam.2019.02.009},
  doi          = {10.1016/J.DAM.2019.02.009},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/DucoffeL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LeitertD19,
  author       = {Arne Leitert and
                  Feodor F. Dragan},
  title        = {Parameterized approximation algorithms for some location problems
                  in graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {755},
  pages        = {48--64},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.06.049},
  doi          = {10.1016/J.TCS.2018.06.049},
  timestamp    = {Fri, 04 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LeitertD19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1809-06041,
  author       = {Guillaume Ducoffe and
                  Arne Leitert},
  title        = {Equivalence between pathbreadth and strong pathbreadth},
  journal      = {CoRR},
  volume       = {abs/1809.06041},
  year         = {2018},
  url          = {http://arxiv.org/abs/1809.06041},
  eprinttype    = {arXiv},
  eprint       = {1809.06041},
  timestamp    = {Fri, 05 Oct 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1809-06041.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/DraganKL17,
  author       = {Feodor F. Dragan and
                  Ekkehard K{\"{o}}hler and
                  Arne Leitert},
  title        = {Line-Distortion, Bandwidth and Path-Length of a Graph},
  journal      = {Algorithmica},
  volume       = {77},
  number       = {3},
  pages        = {686--713},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00453-015-0094-7},
  doi          = {10.1007/S00453-015-0094-7},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/DraganKL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Leitert17,
  author       = {Arne Leitert},
  title        = {3-colouring for dually chordal graphs and generalisations},
  journal      = {Inf. Process. Lett.},
  volume       = {128},
  pages        = {21--26},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.ipl.2017.07.012},
  doi          = {10.1016/J.IPL.2017.07.012},
  timestamp    = {Mon, 16 Oct 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Leitert17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DraganL17,
  author       = {Feodor F. Dragan and
                  Arne Leitert},
  title        = {On the minimum eccentricity shortest path problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {694},
  pages        = {66--78},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2017.07.004},
  doi          = {10.1016/J.TCS.2017.07.004},
  timestamp    = {Thu, 21 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DraganL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoa/LeitertD17,
  author       = {Arne Leitert and
                  Feodor F. Dragan},
  editor       = {Xiaofeng Gao and
                  Hongwei Du and
                  Meng Han},
  title        = {Parameterized Approximation Algorithms for Some Location Problems
                  in Graphs},
  booktitle    = {Combinatorial Optimization and Applications - 11th International Conference,
                  {COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
                  Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10628},
  pages        = {348--361},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-71147-8\_24},
  doi          = {10.1007/978-3-319-71147-8\_24},
  timestamp    = {Tue, 20 Aug 2024 07:54:44 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoa/LeitertD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/LeitertD17,
  author       = {Arne Leitert and
                  Feodor F. Dragan},
  title        = {Parameterized Approximation Algorithms for some Location Problems
                  in Graphs},
  journal      = {CoRR},
  volume       = {abs/1706.07475},
  year         = {2017},
  url          = {http://arxiv.org/abs/1706.07475},
  eprinttype    = {arXiv},
  eprint       = {1706.07475},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/LeitertD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/DraganL16,
  author       = {Feodor F. Dragan and
                  Arne Leitert},
  title        = {Minimum Eccentricity Shortest Paths in some Structured Graph Classes},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {20},
  number       = {2},
  pages        = {299--322},
  year         = {2016},
  url          = {https://doi.org/10.7155/jgaa.00394},
  doi          = {10.7155/JGAA.00394},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/DraganL16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoa/LeitertD16,
  author       = {Arne Leitert and
                  Feodor F. Dragan},
  editor       = {T.{-}H. Hubert Chan and
                  Minming Li and
                  Lusheng Wang},
  title        = {On Strong Tree-Breadth},
  booktitle    = {Combinatorial Optimization and Applications - 10th International Conference,
                  {COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10043},
  pages        = {62--76},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-48749-6\_5},
  doi          = {10.1007/978-3-319-48749-6\_5},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoa/LeitertD16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BrandstadtFLM15,
  author       = {Andreas Brandst{\"{a}}dt and
                  Pavel Ficur and
                  Arne Leitert and
                  Martin Milanic},
  title        = {Polynomial-time algorithms for weighted efficient domination problems
                  in AT-free graphs and dually chordal graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {115},
  number       = {2},
  pages        = {256--262},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ipl.2014.09.024},
  doi          = {10.1016/J.IPL.2014.09.024},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BrandstadtFLM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wads/DraganL15,
  author       = {Feodor F. Dragan and
                  Arne Leitert},
  editor       = {Frank Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Ulrike Stege},
  title        = {On the Minimum Eccentricity Shortest Path Problem},
  booktitle    = {Algorithms and Data Structures - 14th International Symposium, {WADS}
                  2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9214},
  pages        = {276--288},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-21840-3\_23},
  doi          = {10.1007/978-3-319-21840-3\_23},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/DraganL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/DraganL15,
  author       = {Feodor F. Dragan and
                  Arne Leitert},
  editor       = {Ernst W. Mayr},
  title        = {Minimum Eccentricity Shortest Paths in Some Structured Graph Classes},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 41st International
                  Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9224},
  pages        = {189--202},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-53174-7\_14},
  doi          = {10.1007/978-3-662-53174-7\_14},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/DraganL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/DraganL15,
  author       = {Feodor F. Dragan and
                  Arne Leitert},
  title        = {Minimum Eccentricity Shortest Paths in some Structured Graph Classes},
  journal      = {CoRR},
  volume       = {abs/1511.05109},
  year         = {2015},
  url          = {http://arxiv.org/abs/1511.05109},
  eprinttype    = {arXiv},
  eprint       = {1511.05109},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DraganL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/swat/DraganKL14,
  author       = {Feodor F. Dragan and
                  Ekkehard K{\"{o}}hler and
                  Arne Leitert},
  editor       = {R. Ravi and
                  Inge Li G{\o}rtz},
  title        = {Line-Distortion, Bandwidth and Path-Length of a Graph},
  booktitle    = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
                  Copenhagen, Denmark, July 2-4, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8503},
  pages        = {158--169},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-08404-6\_14},
  doi          = {10.1007/978-3-319-08404-6\_14},
  timestamp    = {Sun, 02 Jun 2019 21:15:18 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/DraganKL14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/DraganKL14,
  author       = {Feodor F. Dragan and
                  Ekkehard K{\"{o}}hler and
                  Arne Leitert},
  title        = {Line-distortion, Bandwidth and Path-length of a graph},
  journal      = {CoRR},
  volume       = {abs/1409.8389},
  year         = {2014},
  url          = {http://arxiv.org/abs/1409.8389},
  eprinttype    = {arXiv},
  eprint       = {1409.8389},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DraganKL14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BrandstadtFLM14,
  author       = {Andreas Brandst{\"{a}}dt and
                  Pavel Ficur and
                  Arne Leitert and
                  Martin Milanic},
  title        = {Polynomial-time Algorithms for Weighted Efficient Domination Problems
                  in AT-free Graphs and Dually Chordal Graphs},
  journal      = {CoRR},
  volume       = {abs/1410.0770},
  year         = {2014},
  url          = {http://arxiv.org/abs/1410.0770},
  eprinttype    = {arXiv},
  eprint       = {1410.0770},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BrandstadtFLM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/BrandstadtLR12,
  author       = {Andreas Brandst{\"{a}}dt and
                  Arne Leitert and
                  Dieter Rautenbach},
  editor       = {Kun{-}Mao Chao and
                  Tsan{-}sheng Hsu and
                  Der{-}Tsai Lee},
  title        = {Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs},
  booktitle    = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
                  2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7676},
  pages        = {267--277},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-35261-4\_30},
  doi          = {10.1007/978-3-642-35261-4\_30},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BrandstadtLR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1206-0233,
  author       = {Arne Leitert},
  title        = {3-Colourability of Dually Chordal Graphs in Linear Time},
  journal      = {CoRR},
  volume       = {abs/1206.0233},
  year         = {2012},
  url          = {http://arxiv.org/abs/1206.0233},
  eprinttype    = {arXiv},
  eprint       = {1206.0233},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1206-0233.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1207-0953,
  author       = {Andreas Brandst{\"{a}}dt and
                  Arne Leitert and
                  Dieter Rautenbach},
  title        = {Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs},
  journal      = {CoRR},
  volume       = {abs/1207.0953},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.0953},
  eprinttype    = {arXiv},
  eprint       = {1207.0953},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-0953.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.