BibTeX records: Udi Rotics

download as .bib file

@article{DBLP:journals/dam/HeggernesMPR16,
  author       = {Pinar Heggernes and
                  Daniel Meister and
                  Charis Papadopoulos and
                  Udi Rotics},
  title        = {Clique-width of path powers},
  journal      = {Discret. Appl. Math.},
  volume       = {205},
  pages        = {62--72},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.dam.2015.11.009},
  doi          = {10.1016/J.DAM.2015.11.009},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/HeggernesMPR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MeisterR15,
  author       = {Daniel Meister and
                  Udi Rotics},
  title        = {Clique-width of full bubble model graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {185},
  pages        = {138--167},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.dam.2014.12.001},
  doi          = {10.1016/J.DAM.2014.12.001},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MeisterR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CourcelleHMPR15,
  author       = {Bruno Courcelle and
                  Pinar Heggernes and
                  Daniel Meister and
                  Charis Papadopoulos and
                  Udi Rotics},
  title        = {A characterisation of clique-width through nested partitions},
  journal      = {Discret. Appl. Math.},
  volume       = {187},
  pages        = {70--81},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.dam.2015.02.016},
  doi          = {10.1016/J.DAM.2015.02.016},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/CourcelleHMPR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/MeisterR13,
  author       = {Daniel Meister and
                  Udi Rotics},
  title        = {Minimal forbidden induced subgraphs of graphs of bounded clique-width
                  and bounded linear clique-width},
  journal      = {CoRR},
  volume       = {abs/1306.2114},
  year         = {2013},
  url          = {http://arxiv.org/abs/1306.2114},
  eprinttype    = {arXiv},
  eprint       = {1306.2114},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/MeisterR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CorneilHLRR12,
  author       = {Derek G. Corneil and
                  Michel Habib and
                  Jean{-}Marc Lanlignel and
                  Bruce A. Reed and
                  Udi Rotics},
  title        = {Polynomial-time recognition of clique-width {\(\leq\)}3 graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {160},
  number       = {6},
  pages        = {834--865},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.dam.2011.03.020},
  doi          = {10.1016/J.DAM.2011.03.020},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/CorneilHLRR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csr/HeggernesMR11,
  author       = {Pinar Heggernes and
                  Daniel Meister and
                  Udi Rotics},
  editor       = {Alexander S. Kulikov and
                  Nikolay K. Vereshchagin},
  title        = {Computing the Clique-Width of Large Path Powers in Linear Time via
                  a New Characterisation of Clique-Width},
  booktitle    = {Computer Science - Theory and Applications - 6th International Computer
                  Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
                  14-18, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6651},
  pages        = {233--246},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20712-9\_18},
  doi          = {10.1007/978-3-642-20712-9\_18},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/csr/HeggernesMR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tamc/HeggernesMR10,
  author       = {Pinar Heggernes and
                  Daniel Meister and
                  Udi Rotics},
  editor       = {Jan Kratochv{\'{\i}}l and
                  Angsheng Li and
                  Jir{\'{\i}} Fiala and
                  Petr Kolman},
  title        = {Exploiting Restricted Linear Structure to Cope with the Hardness of
                  Clique-Width},
  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        = {284--295},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13562-0\_26},
  doi          = {10.1007/978-3-642-13562-0\_26},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/HeggernesMR10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/FellowsRRS09,
  author       = {Michael R. Fellows and
                  Frances A. Rosamond and
                  Udi Rotics and
                  Stefan Szeider},
  title        = {Clique-Width is NP-Complete},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {23},
  number       = {2},
  pages        = {909--939},
  year         = {2009},
  url          = {https://doi.org/10.1137/070687256},
  doi          = {10.1137/070687256},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/FellowsRRS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KorachPR08,
  author       = {Ephraim Korach and
                  Uri N. Peled and
                  Udi Rotics},
  title        = {Equistable distance-hereditary graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {156},
  number       = {4},
  pages        = {462--477},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.dam.2006.06.018},
  doi          = {10.1016/J.DAM.2006.06.018},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KorachPR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GolumbicMR08,
  author       = {Martin Charles Golumbic and
                  Aviad Mintz and
                  Udi Rotics},
  title        = {An improvement on the complexity of factoring read-once Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {156},
  number       = {10},
  pages        = {1633--1636},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.dam.2008.02.011},
  doi          = {10.1016/J.DAM.2008.02.011},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GolumbicMR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GolumbicMR06,
  author       = {Martin Charles Golumbic and
                  Aviad Mintz and
                  Udi Rotics},
  title        = {Factoring and recognition of read-once functions using cographs and
                  normality and the readability of functions associated with partial
                  k-trees},
  journal      = {Discret. Appl. Math.},
  volume       = {154},
  number       = {10},
  pages        = {1465--1477},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.dam.2005.09.016},
  doi          = {10.1016/J.DAM.2005.09.016},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GolumbicMR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/FellowsRRS06,
  author       = {Michael R. Fellows and
                  Frances A. Rosamond and
                  Udi Rotics and
                  Stefan Szeider},
  editor       = {Jon M. Kleinberg},
  title        = {Clique-width minimization is NP-hard},
  booktitle    = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
                  Seattle, WA, USA, May 21-23, 2006},
  pages        = {354--362},
  publisher    = {{ACM}},
  year         = {2006},
  url          = {https://doi.org/10.1145/1132516.1132568},
  doi          = {10.1145/1132516.1132568},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/FellowsRRS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/MakowskyRAG06,
  author       = {Johann A. Makowsky and
                  Udi Rotics and
                  Ilya Averbouch and
                  Benny Godlin},
  editor       = {Fedor V. Fomin},
  title        = {Computing Graph Polynomials on Graphs of Bounded Clique-Width},
  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        = {191--204},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11917496\_18},
  doi          = {10.1007/11917496\_18},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/MakowskyRAG06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/endm/GolumbicMR05,
  author       = {Martin Charles Golumbic and
                  Aviad Mintz and
                  Udi Rotics},
  title        = {Read-Once Functions Revisited and the Readability Number of a Boolean
                  Function},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {22},
  pages        = {357--361},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.endm.2005.06.076},
  doi          = {10.1016/J.ENDM.2005.06.076},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/GolumbicMR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/CorneilR05,
  author       = {Derek G. Corneil and
                  Udi Rotics},
  title        = {On the Relationship Between Clique-Width and Treewidth},
  journal      = {{SIAM} J. Comput.},
  volume       = {34},
  number       = {4},
  pages        = {825--847},
  year         = {2005},
  url          = {https://doi.org/10.1137/S0097539701385351},
  doi          = {10.1137/S0097539701385351},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/CorneilR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR05-080,
  author       = {Michael R. Fellows and
                  Frances A. Rosamond and
                  Udi Rotics and
                  Stefan Szeider},
  title        = {Proving NP-hardness for clique-width {I:} non-approximability of sequential
                  clique-width},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR05-080}},
  year         = {2005},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-080/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR05-080},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR05-080.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR05-081,
  author       = {Michael R. Fellows and
                  Frances A. Rosamond and
                  Udi Rotics and
                  Stefan Szeider},
  title        = {Proving NP-hardness for clique-width {II:} non-approximability of
                  clique-width},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR05-081}},
  year         = {2005},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-081/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR05-081},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR05-081.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BodlaenderR03,
  author       = {Hans L. Bodlaender and
                  Udi Rotics},
  title        = {Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition},
  journal      = {Algorithmica},
  volume       = {36},
  number       = {4},
  pages        = {375--408},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1026-5},
  doi          = {10.1007/S00453-003-1026-5},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BodlaenderR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/KoblerR03,
  author       = {Daniel Kobler and
                  Udi Rotics},
  title        = {Finding Maximum Induced Matchings in Subclasses of Claw-Free and {P}
                  5-Free Graphs, and in Graphs with Matching and Induced Matching of
                  Equal Maximum Size},
  journal      = {Algorithmica},
  volume       = {37},
  number       = {4},
  pages        = {327--346},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00453-003-1035-4},
  doi          = {10.1007/S00453-003-1035-4},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KoblerR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KoblerR03,
  author       = {Daniel Kobler and
                  Udi Rotics},
  title        = {Edge dominating set and colorings on graphs with fixed clique-width},
  journal      = {Discret. Appl. Math.},
  volume       = {126},
  number       = {2-3},
  pages        = {197--221},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0166-218X(02)00198-1},
  doi          = {10.1016/S0166-218X(02)00198-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KoblerR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/PeledR03,
  author       = {Uri N. Peled and
                  Udi Rotics},
  title        = {Equistable chordal graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {132},
  number       = {1-3},
  pages        = {203--210},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0166-218X(03)00401-3},
  doi          = {10.1016/S0166-218X(03)00401-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/PeledR03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/swat/BodlaenderR02,
  author       = {Hans L. Bodlaender and
                  Udi Rotics},
  editor       = {Martti Penttonen and
                  Erik Meineche Schmidt},
  title        = {Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition},
  booktitle    = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
                  Theory, Turku, Finland, July 3-5, 2002 Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2368},
  pages        = {388--397},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45471-3\_40},
  doi          = {10.1007/3-540-45471-3\_40},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/BodlaenderR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CourcelleMR01,
  author       = {Bruno Courcelle and
                  Johann A. Makowsky and
                  Udi Rotics},
  title        = {On the fixed parameter complexity of graph enumeration problems definable
                  in monadic second-order logic},
  journal      = {Discret. Appl. Math.},
  volume       = {108},
  number       = {1-2},
  pages        = {23--52},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(00)00221-3},
  doi          = {10.1016/S0166-218X(00)00221-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CourcelleMR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dac/GolumbicMR01,
  author       = {Martin Charles Golumbic and
                  Aviad Mintz and
                  Udi Rotics},
  title        = {Factoring and Recognition of Read-Once Functions using Cographs and
                  Normality},
  booktitle    = {Proceedings of the 38th Design Automation Conference, {DAC} 2001,
                  Las Vegas, NV, USA, June 18-22, 2001},
  pages        = {109--114},
  publisher    = {{ACM}},
  year         = {2001},
  url          = {https://doi.org/10.1145/378239.378356},
  doi          = {10.1145/378239.378356},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/dac/GolumbicMR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/KoblerR01,
  author       = {Daniel Kobler and
                  Udi Rotics},
  editor       = {S. Rao Kosaraju},
  title        = {Polynomial algorithms for partitioning problems on graphs with fixed
                  clique-width (extended abstract)},
  booktitle    = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
                  January 7-9, 2001, Washington, DC, {USA}},
  pages        = {468--476},
  publisher    = {{ACM/SIAM}},
  year         = {2001},
  url          = {http://dl.acm.org/citation.cfm?id=365411.365510},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/KoblerR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/CorneilR01,
  author       = {Derek G. Corneil and
                  Udi Rotics},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Van Bang Le},
  title        = {On the Relationship between Clique-Width and Treewidth},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
                  {WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2204},
  pages        = {78--90},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45477-2\_9},
  doi          = {10.1007/3-540-45477-2\_9},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/CorneilR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/GolumbicR00,
  author       = {Martin Charles Golumbic and
                  Udi Rotics},
  title        = {On the Clique-Width of Some Perfect Graph Classes},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {11},
  number       = {3},
  pages        = {423--443},
  year         = {2000},
  url          = {https://doi.org/10.1142/S0129054100000260},
  doi          = {10.1142/S0129054100000260},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/GolumbicR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mst/CourcelleMR00,
  author       = {Bruno Courcelle and
                  Johann A. Makowsky and
                  Udi Rotics},
  title        = {Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width},
  journal      = {Theory Comput. Syst.},
  volume       = {33},
  number       = {2},
  pages        = {125--150},
  year         = {2000},
  url          = {https://doi.org/10.1007/s002249910009},
  doi          = {10.1007/S002249910009},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/CourcelleMR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/latin/CorneilHLRR00,
  author       = {Derek G. Corneil and
                  Michel Habib and
                  Jean{-}Marc Lanlignel and
                  Bruce A. Reed and
                  Udi Rotics},
  editor       = {Gaston H. Gonnet and
                  Daniel Panario and
                  Alfredo Viola},
  title        = {Polynomial Time Recognition of Clique-Width {\textbackslash}le {\textbackslash}leq
                  3 Graphs (Extended Abstract)},
  booktitle    = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium,
                  Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1776},
  pages        = {126--134},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/10719839\_14},
  doi          = {10.1007/10719839\_14},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/CorneilHLRR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/MakowskyR99,
  author       = {Johann A. Makowsky and
                  Udi Rotics},
  title        = {On the Clique-Width of Graphs with Few P\({}_{\mbox{4}}\)'s},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {10},
  number       = {3},
  pages        = {329--348},
  year         = {1999},
  url          = {https://doi.org/10.1142/S0129054199000241},
  doi          = {10.1142/S0129054199000241},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/MakowskyR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/GolumbicR99,
  author       = {Martin Charles Golumbic and
                  Udi Rotics},
  editor       = {Peter Widmayer and
                  Gabriele Neyer and
                  Stephan J. Eidenbenz},
  title        = {On the Clique-Width of Perfect Graph Classes},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
                  {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1665},
  pages        = {135--147},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-46784-X\_14},
  doi          = {10.1007/3-540-46784-X\_14},
  timestamp    = {Wed, 11 Sep 2019 13:15:53 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/GolumbicR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/il/Rotics98,
  author       = {Udi Rotics},
  title        = {Efficient algorithms for generally intractable graph problems restricted
                  to specific classes of graphs},
  school       = {Technion - Israel Institute of Technology, Israel},
  year         = {1998},
  url          = {https://technion.primo.exlibrisgroup.com/permalink/972TEC\_INST/q1jq5o/alma990022015670203971},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/il/Rotics98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/CourcelleMR98,
  author       = {Bruno Courcelle and
                  Johann A. Makowsky and
                  Udi Rotics},
  editor       = {Juraj Hromkovic and
                  Ondrej S{\'{y}}kora},
  title        = {Linear Time Solvable Optimization Problems on Graphs of Bounded Clique
                  Width},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
                  {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1517},
  pages        = {1--16},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/10692760\_1},
  doi          = {10.1007/10692760\_1},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/CourcelleMR98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/VenkatesanRMMR97,
  author       = {G. Venkatesan and
                  Udi Rotics and
                  M. S. Madanlal and
                  Johann A. Makowsky and
                  C. Pandu Rangan},
  title        = {Restrictions of Minimum Spanner Problems},
  journal      = {Inf. Comput.},
  volume       = {136},
  number       = {2},
  pages        = {143--164},
  year         = {1997},
  url          = {https://doi.org/10.1006/inco.1997.2641},
  doi          = {10.1006/INCO.1997.2641},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/VenkatesanRMMR97.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.