BibTeX records: Yahav Nussbaum

download as .bib file

@article{DBLP:journals/tcs/MozesNW18,
  author       = {Shay Mozes and
                  Yahav Nussbaum and
                  Oren Weimann},
  title        = {Faster shortest paths in dense distance graphs, with applications},
  journal      = {Theor. Comput. Sci.},
  volume       = {711},
  pages        = {11--35},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.034},
  doi          = {10.1016/J.TCS.2017.10.034},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/MozesNW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/MozesNNW18,
  author       = {Shay Mozes and
                  Kirill Nikolaev and
                  Yahav Nussbaum and
                  Oren Weimann},
  editor       = {Artur Czumaj},
  title        = {Minimum Cut of Directed Planar Graphs in \emph{O}(\emph{n} log log
                  \emph{n}) Time},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages        = {477--494},
  publisher    = {{SIAM}},
  year         = {2018},
  url          = {https://doi.org/10.1137/1.9781611975031.32},
  doi          = {10.1137/1.9781611975031.32},
  timestamp    = {Thu, 11 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/MozesNNW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BorradaileKMNW17,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Shay Mozes and
                  Yahav Nussbaum and
                  Christian Wulff{-}Nilsen},
  title        = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
                  in Near-Linear Time},
  journal      = {{SIAM} J. Comput.},
  volume       = {46},
  number       = {4},
  pages        = {1280--1303},
  year         = {2017},
  url          = {https://doi.org/10.1137/15M1042929},
  doi          = {10.1137/15M1042929},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BorradaileKMNW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/KaplanMNS17,
  author       = {Haim Kaplan and
                  Shay Mozes and
                  Yahav Nussbaum and
                  Micha Sharir},
  title        = {Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices,
                  and Their Applications},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {13},
  number       = {2},
  pages        = {26:1--26:42},
  year         = {2017},
  url          = {https://doi.org/10.1145/3039873},
  doi          = {10.1145/3039873},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/KaplanMNS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/McConnellN15,
  author       = {Ross M. McConnell and
                  Yahav Nussbaum},
  title        = {Linear-Time Recognition of Probe Interval Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {29},
  number       = {4},
  pages        = {2006--2046},
  year         = {2015},
  url          = {https://doi.org/10.1137/130930091},
  doi          = {10.1137/130930091},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/McConnellN15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/MozesNNW15,
  author       = {Shay Mozes and
                  Cyril Nikolaev and
                  Yahav Nussbaum and
                  Oren Weimann},
  title        = {Minimum Cut of Directed Planar Graphs in O(nloglogn) Time},
  journal      = {CoRR},
  volume       = {abs/1512.02068},
  year         = {2015},
  url          = {http://arxiv.org/abs/1512.02068},
  eprinttype    = {arXiv},
  eprint       = {1512.02068},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/MozesNNW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Nussbaum14,
  author       = {Yahav Nussbaum},
  title        = {Recognition of probe proper interval graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {167},
  pages        = {228--238},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.dam.2013.11.013},
  doi          = {10.1016/J.DAM.2013.11.013},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Nussbaum14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/MozesNW14,
  author       = {Shay Mozes and
                  Yahav Nussbaum and
                  Oren Weimann},
  title        = {Faster Shortest Paths in Dense Distance Graphs, with Applications},
  journal      = {CoRR},
  volume       = {abs/1404.0977},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.0977},
  eprinttype    = {arXiv},
  eprint       = {1404.0977},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/MozesNW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmtcs/CurtisLMNSSS13,
  author       = {Andrew R. Curtis and
                  Min Chih Lin and
                  Ross M. McConnell and
                  Yahav Nussbaum and
                  Francisco J. Soulignac and
                  Jeremy P. Spinrad and
                  Jayme Luiz Szwarcfiter},
  title        = {Isomorphism of graph classes related to the circular-ones property},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {15},
  number       = {1},
  pages        = {157--182},
  year         = {2013},
  url          = {https://doi.org/10.46298/dmtcs.625},
  doi          = {10.46298/DMTCS.625},
  timestamp    = {Tue, 31 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/CurtisLMNSSS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/KaplanN13,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  title        = {Min-Cost Flow Duality in Planar Networks},
  journal      = {CoRR},
  volume       = {abs/1306.6728},
  year         = {2013},
  url          = {http://arxiv.org/abs/1306.6728},
  eprinttype    = {arXiv},
  eprint       = {1306.6728},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KaplanN13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/McConnellN13,
  author       = {Ross M. McConnell and
                  Yahav Nussbaum},
  title        = {Linear-Time Recognition of Probe Interval Graphs},
  journal      = {CoRR},
  volume       = {abs/1307.5547},
  year         = {2013},
  url          = {http://arxiv.org/abs/1307.5547},
  eprinttype    = {arXiv},
  eprint       = {1307.5547},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/McConnellN13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/LackiNSW12,
  author       = {Jakub Lacki and
                  Yahav Nussbaum and
                  Piotr Sankowski and
                  Christian Wulff{-}Nilsen},
  title        = {Single Source - All Sinks Max Flows in Planar Digraphs},
  booktitle    = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2012, New Brunswick, NJ, USA, October 20-23, 2012},
  pages        = {599--608},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/FOCS.2012.66},
  doi          = {10.1109/FOCS.2012.66},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/LackiNSW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/KaplanMNS12,
  author       = {Haim Kaplan and
                  Shay Mozes and
                  Yahav Nussbaum and
                  Micha Sharir},
  editor       = {Yuval Rabani},
  title        = {Submatrix maximum queries in Monge matrices and Monge partial matrices,
                  and their applications},
  booktitle    = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages        = {338--355},
  publisher    = {{SIAM}},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611973099.31},
  doi          = {10.1137/1.9781611973099.31},
  timestamp    = {Tue, 02 Feb 2021 17:07:31 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KaplanMNS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1203-4822,
  author       = {Andrew R. Curtis and
                  Min Chih Lin and
                  Ross M. McConnell and
                  Yahav Nussbaum and
                  Francisco J. Soulignac and
                  Jeremy P. Spinrad and
                  Jayme Luiz Szwarcfiter},
  title        = {Isomorphism of graph classes related to the circular-ones property},
  journal      = {CoRR},
  volume       = {abs/1203.4822},
  year         = {2012},
  url          = {http://arxiv.org/abs/1203.4822},
  eprinttype    = {arXiv},
  eprint       = {1203.4822},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1203-4822.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1210-4811,
  author       = {Jakub Lacki and
                  Yahav Nussbaum and
                  Piotr Sankowski and
                  Christian Wulff{-}Nilsen},
  title        = {Single Source - All Sinks Max Flows in Planar Digraphs},
  journal      = {CoRR},
  volume       = {abs/1210.4811},
  year         = {2012},
  url          = {http://arxiv.org/abs/1210.4811},
  eprinttype    = {arXiv},
  eprint       = {1210.4811},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1210-4811.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KaplanN11,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  title        = {Maximum Flow in Directed Planar Graphs with Vertex Capacities},
  journal      = {Algorithmica},
  volume       = {61},
  number       = {1},
  pages        = {174--189},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9436-7},
  doi          = {10.1007/S00453-010-9436-7},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KaplanN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KaplanN11a,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  title        = {A Simpler Linear-Time Recognition of Circular-Arc Graphs},
  journal      = {Algorithmica},
  volume       = {61},
  number       = {3},
  pages        = {694--737},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-010-9432-y},
  doi          = {10.1007/S00453-010-9432-Y},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KaplanN11a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BorradaileKMNW11,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Shay Mozes and
                  Yahav Nussbaum and
                  Christian Wulff{-}Nilsen},
  editor       = {Rafail Ostrovsky},
  title        = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
                  in Near-Linear Time},
  booktitle    = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
                  2011, Palm Springs, CA, USA, October 22-25, 2011},
  pages        = {170--179},
  publisher    = {{IEEE} Computer Society},
  year         = {2011},
  url          = {https://doi.org/10.1109/FOCS.2011.73},
  doi          = {10.1109/FOCS.2011.73},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BorradaileKMNW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/KaplanN11,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  editor       = {Thomas Schwentick and
                  Christoph D{\"{u}}rr},
  title        = {Minimum s-t cut in undirected planar graphs when the source and the
                  sink are close},
  booktitle    = {28th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2011, March 10-12, 2011, Dortmund, Germany},
  series       = {LIPIcs},
  volume       = {9},
  pages        = {117--128},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2011},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2011.117},
  doi          = {10.4230/LIPICS.STACS.2011.117},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/KaplanN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/ItalianoNSW11,
  author       = {Giuseppe F. Italiano and
                  Yahav Nussbaum and
                  Piotr Sankowski and
                  Christian Wulff{-}Nilsen},
  editor       = {Lance Fortnow and
                  Salil P. Vadhan},
  title        = {Improved algorithms for min cut and max flow in undirected planar
                  graphs},
  booktitle    = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
                  2011, San Jose, CA, USA, 6-8 June 2011},
  pages        = {313--322},
  publisher    = {{ACM}},
  year         = {2011},
  url          = {https://doi.org/10.1145/1993636.1993679},
  doi          = {10.1145/1993636.1993679},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/ItalianoNSW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wads/Nussbaum11,
  author       = {Yahav Nussbaum},
  editor       = {Frank Dehne and
                  John Iacono and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title        = {Improved Distance Queries in Planar Graphs},
  booktitle    = {Algorithms and Data Structures - 12th International Symposium, {WADS}
                  2011, New York, NY, USA, August 15-17, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6844},
  pages        = {642--653},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22300-6\_54},
  doi          = {10.1007/978-3-642-22300-6\_54},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/Nussbaum11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1105-2228,
  author       = {Glencora Borradaile and
                  Philip N. Klein and
                  Shay Mozes and
                  Yahav Nussbaum and
                  Christian Wulff{-}Nilsen},
  title        = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
                  in Near-Linear Time},
  journal      = {CoRR},
  volume       = {abs/1105.2228},
  year         = {2011},
  url          = {http://arxiv.org/abs/1105.2228},
  eprinttype    = {arXiv},
  eprint       = {1105.2228},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1105-2228.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1012-2825,
  author       = {Yahav Nussbaum},
  title        = {Improved distance queries in planar graphs},
  journal      = {CoRR},
  volume       = {abs/1012.2825},
  year         = {2010},
  url          = {http://arxiv.org/abs/1012.2825},
  eprinttype    = {arXiv},
  eprint       = {1012.2825},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1012-2825.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1012-4767,
  author       = {Yahav Nussbaum},
  title        = {Multiple-source multiple-sink maximum flow in planar graphs},
  journal      = {CoRR},
  volume       = {abs/1012.4767},
  year         = {2010},
  url          = {http://arxiv.org/abs/1012.4767},
  eprinttype    = {arXiv},
  eprint       = {1012.4767},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1012-4767.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KaplanN09,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  title        = {Certifying algorithms for recognizing proper circular-arc graphs and
                  unit circular-arc graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {157},
  number       = {15},
  pages        = {3216--3230},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.dam.2009.07.002},
  doi          = {10.1016/J.DAM.2009.07.002},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KaplanN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/McConnellN09,
  author       = {Ross M. McConnell and
                  Yahav Nussbaum},
  editor       = {Amos Fiat and
                  Peter Sanders},
  title        = {Linear-Time Recognition of Probe Interval Graphs},
  booktitle    = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
                  Denmark, September 7-9, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5757},
  pages        = {349--360},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-04128-0\_32},
  doi          = {10.1007/978-3-642-04128-0\_32},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/McConnellN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/KaplanN09,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  editor       = {Amos Fiat and
                  Peter Sanders},
  title        = {Maximum Flow in Directed Planar Graphs with Vertex Capacities},
  booktitle    = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
                  Denmark, September 7-9, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5757},
  pages        = {397--407},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-04128-0\_36},
  doi          = {10.1007/978-3-642-04128-0\_36},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/KaplanN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0905-0451,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  title        = {Maximum Flow in Directed Planar Graphs with Vertex Capacities},
  journal      = {CoRR},
  volume       = {abs/0905.0451},
  year         = {2009},
  url          = {http://arxiv.org/abs/0905.0451},
  eprinttype    = {arXiv},
  eprint       = {0905.0451},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0905-0451.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/Nussbaum08,
  author       = {Yahav Nussbaum},
  editor       = {Hajo Broersma and
                  Thomas Erlebach and
                  Tom Friedetzky and
                  Dani{\"{e}}l Paulusma},
  title        = {From a Circular-Arc Model to a Proper Circular-Arc Model},
  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        = {324--335},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92248-3\_29},
  doi          = {10.1007/978-3-540-92248-3\_29},
  timestamp    = {Sun, 25 Oct 2020 23:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/Nussbaum08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:books/daglib/0018070,
  author       = {Yahav Nussbaum},
  title        = {Recognition of circular-arc graphs and some subclasses},
  school       = {University of Tel-Aviv},
  year         = {2007},
  timestamp    = {Wed, 09 Feb 2011 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/books/daglib/0018070.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/swat/KaplanN06,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  editor       = {Lars Arge and
                  Rusins Freivalds},
  title        = {A Simpler Linear-Time Recognition of Circular-Arc Graphs},
  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        = {41--52},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11785293\_7},
  doi          = {10.1007/11785293\_7},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/KaplanN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/KaplanN06,
  author       = {Haim Kaplan and
                  Yahav Nussbaum},
  editor       = {Fedor V. Fomin},
  title        = {Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and
                  Unit Circular-Arc Graphs},
  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        = {289--300},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11917496\_26},
  doi          = {10.1007/11917496\_26},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/KaplanN06.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.