Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/wg/wg2009.bht:"
download as .bib file
@proceedings{DBLP:conf/wg/2009,
editor = {Christophe Paul and
Michel Habib},
title = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11409-0},
doi = {10.1007/978-3-642-11409-0},
isbn = {978-3-642-11408-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AverbouchMT09,
author = {Ilya Averbouch and
Johann A. Makowsky and
Peter Tittmann},
editor = {Christophe Paul and
Michel Habib},
title = {A Graph Polynomial Arising from Community Structure (Extended Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {33--43},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_3},
doi = {10.1007/978-3-642-11409-0\_3},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/AverbouchMT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaFHP09,
author = {Hajo Broersma and
Fedor V. Fomin and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Christophe Paul and
Michel Habib},
title = {Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {44--53},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_4},
doi = {10.1007/978-3-642-11409-0\_4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaFHP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CalinescuFK09,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Hemanshu Kaul},
editor = {Christophe Paul and
Michel Habib},
title = {Maximum Series-Parallel Subgraph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {54--65},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_5},
doi = {10.1007/978-3-642-11409-0\_5},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/CalinescuFK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChechikP09,
author = {Shiri Chechik and
David Peleg},
editor = {Christophe Paul and
Michel Habib},
title = {Low-Port Tree Representations},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {66--76},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_6},
doi = {10.1007/978-3-642-11409-0\_6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChechikP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Crespelle09,
author = {Christophe Crespelle},
editor = {Christophe Paul and
Michel Habib},
title = {Fully Dynamic Representations of Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {77--87},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_7},
doi = {10.1007/978-3-642-11409-0\_7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Crespelle09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DvorakK09,
author = {Zdenek Dvor{\'{a}}k and
Daniel Kr{\'{a}}l},
editor = {Christophe Paul and
Michel Habib},
title = {Algorithms for Classes of Graphs with Bounded Expansion},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {17--32},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_2},
doi = {10.1007/978-3-642-11409-0\_2},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DvorakK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Eppstein09,
author = {David Eppstein},
editor = {Christophe Paul and
Michel Habib},
title = {Graph-Theoretic Solutions to Computational Geometry Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {1--16},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_1},
doi = {10.1007/978-3-642-11409-0\_1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Eppstein09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FellowsGK09,
author = {Michael R. Fellows and
Jiong Guo and
Iyad A. Kanj},
editor = {Christophe Paul and
Michel Habib},
title = {The Parameterized Complexity of Some Minimum Label Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {88--99},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_8},
doi = {10.1007/978-3-642-11409-0\_8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/FellowsGK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FernauGR09,
author = {Henning Fernau and
Serge Gaspers and
Daniel Raible},
editor = {Christophe Paul and
Michel Habib},
title = {Exact and Parameterized Algorithms for Max Internal Spanning Tree},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {100--111},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_9},
doi = {10.1007/978-3-642-11409-0\_9},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/FernauGR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FominLS09,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Saket Saurabh},
editor = {Christophe Paul and
Michel Habib},
title = {An Exact Algorithm for Minimum Distortion Embedding},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {112--121},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_10},
doi = {10.1007/978-3-642-11409-0\_10},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FominLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GandhiGPR09,
author = {Rajiv Gandhi and
Bradford Greening and
Sriram V. Pemmaraju and
Rajiv Raman},
editor = {Christophe Paul and
Michel Habib},
title = {Sub-coloring and Hypo-coloring Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {122--132},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_11},
doi = {10.1007/978-3-642-11409-0\_11},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GandhiGPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachKS09,
author = {Petr A. Golovach and
Jan Kratochv{\'{\i}}l and
Ondrej Such{\'{y}}},
editor = {Christophe Paul and
Michel Habib},
title = {Parameterized Complexity of Generalized Domination Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {133--142},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_12},
doi = {10.1007/978-3-642-11409-0\_12},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GrigorievS09,
author = {Alexander Grigoriev and
Ren{\'{e}} Sitters},
editor = {Christophe Paul and
Michel Habib},
title = {Connected Feedback Vertex Set in Planar Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {143--153},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_13},
doi = {10.1007/978-3-642-11409-0\_13},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GrigorievS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GrumbachW09,
author = {St{\'{e}}phane Grumbach and
Zhilin Wu},
editor = {Christophe Paul and
Michel Habib},
title = {Logical Locality Entails Frugal Distributed Computation over Graphs
(Extended Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {154--165},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_14},
doi = {10.1007/978-3-642-11409-0\_14},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GrumbachW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GurskiW09,
author = {Frank Gurski and
Egon Wanke},
editor = {Christophe Paul and
Michel Habib},
title = {On Module-Composed Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {166--177},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_15},
doi = {10.1007/978-3-642-11409-0\_15},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GurskiW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Hagerup09,
author = {Torben Hagerup},
editor = {Christophe Paul and
Michel Habib},
title = {An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning
Trees},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {178--189},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_16},
doi = {10.1007/978-3-642-11409-0\_16},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Hagerup09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HofKP09,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Christophe Paul and
Michel Habib},
title = {Finding Induced Paths of Given Parity in Claw-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {341--352},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_30},
doi = {10.1007/978-3-642-11409-0\_30},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HofKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KammerT09,
author = {Frank Kammer and
Torsten Tholey},
editor = {Christophe Paul and
Michel Habib},
title = {The k-Disjoint Paths Problem on Chordal Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {190--201},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_17},
doi = {10.1007/978-3-642-11409-0\_17},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/KammerT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KanjWZ09,
author = {Iyad A. Kanj and
Andreas Wiese and
Fenghui Zhang},
editor = {Christophe Paul and
Michel Habib},
title = {Local Algorithms for Edge Colorings in UDGs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {202--213},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_18},
doi = {10.1007/978-3-642-11409-0\_18},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/KanjWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KanteR09,
author = {Mamadou Moustapha Kant{\'{e}} and
Micha{\"{e}}l Rao},
editor = {Christophe Paul and
Michel Habib},
title = {Directed Rank-Width and Displit Decomposition},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {214--225},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_19},
doi = {10.1007/978-3-642-11409-0\_19},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/KanteR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KatzRW09,
author = {Bastian Katz and
Ignaz Rutter and
Gerhard J. Woeginger},
editor = {Christophe Paul and
Michel Habib},
title = {An Algorithmic Study of Switch Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {226--237},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_20},
doi = {10.1007/978-3-642-11409-0\_20},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/KatzRW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KreutzerO09,
author = {Stephan Kreutzer and
Sebastian Ordyniak},
editor = {Christophe Paul and
Michel Habib},
title = {Distance \emph{d}-Domination Games},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {308--319},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_27},
doi = {10.1007/978-3-642-11409-0\_27},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/KreutzerO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeT09,
author = {Van Bang Le and
Nguyen Ngoc Tuy},
editor = {Christophe Paul and
Michel Habib},
title = {Hardness Results and Efficient Algorithms for Graph Powers},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {238--249},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_21},
doi = {10.1007/978-3-642-11409-0\_21},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/LeT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LiS09,
author = {Zhentao Li and
Ignasi Sau},
editor = {Christophe Paul and
Michel Habib},
title = {Graph Partitioning and Traffic Grooming with Bounded Degree Request
Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {250--261},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_22},
doi = {10.1007/978-3-642-11409-0\_22},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/LiS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MacGillivrayRS09,
author = {Gary MacGillivray and
Andr{\'{e}} Raspaud and
Jacobus Swarts},
editor = {Christophe Paul and
Michel Habib},
title = {Injective Oriented Colourings},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {262--272},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_23},
doi = {10.1007/978-3-642-11409-0\_23},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/MacGillivrayRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MeisterT09,
author = {Daniel Meister and
Jan Arne Telle},
editor = {Christophe Paul and
Michel Habib},
title = {Chordal Digraphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {273--284},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_24},
doi = {10.1007/978-3-642-11409-0\_24},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/MeisterT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MertziosSZ09,
author = {George B. Mertzios and
Ignasi Sau and
Shmuel Zaks},
editor = {Christophe Paul and
Michel Habib},
title = {A New Intersection Model and Improved Algorithms for Tolerance Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {285--295},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_25},
doi = {10.1007/978-3-642-11409-0\_25},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/MertziosSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/OkamotoUU09,
author = {Yoshio Okamoto and
Ryuhei Uehara and
Takeaki Uno},
editor = {Christophe Paul and
Michel Habib},
title = {Counting the Number of Matchings in Chordal and Chordal Bipartite
Graph Classes},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {296--307},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_26},
doi = {10.1007/978-3-642-11409-0\_26},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/OkamotoUU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/PensoRS09,
author = {Lucia Draque Penso and
Dieter Rautenbach and
Jayme Luiz Szwarcfiter},
editor = {Christophe Paul and
Michel Habib},
title = {Cycles, Paths, Connectivity and Diameter in Distance Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {320--328},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_28},
doi = {10.1007/978-3-642-11409-0\_28},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/PensoRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ShremSG09,
author = {Shimon Shrem and
Michal Stern and
Martin Charles Golumbic},
editor = {Christophe Paul and
Michel Habib},
title = {Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {329--340},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_29},
doi = {10.1007/978-3-642-11409-0\_29},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ShremSG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-20 11:40 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
