default search action

combined dblp search
author search
venue search
publication search

ask others

Search dblp for Publications

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

export results for "toc:db/conf/iwoca/iwoca2019.bht:"

> Home > Search

download as .bib file

@inproceedings{DBLP:conf/iwoca/0001GSS19,
  author       = {Sandip Das and
                  Harmender Gahlawat and
                  Uma Kant Sahoo and
                  Sagnik Sen},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Cops and Robber on Some Families of Oriented Graphs},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {188--200},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_16},
  doi          = {10.1007/978-3-030-25005-8\_16},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/0001GSS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BahooBDS19,
  author       = {Yeganeh Bahoo and
                  Prosenjit Bose and
                  Stephane Durocher and
                  Thomas C. Shermer},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Computing the k-Crossing Visibility Region of a Point in a Polygon},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {10--21},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_2},
  doi          = {10.1007/978-3-030-25005-8\_2},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BahooBDS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BaigKS19,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh and
                  Chirag Sodani},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {An Improved Scheme in the Two Query Adaptive Bitprobe Model},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {22--34},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_3},
  doi          = {10.1007/978-3-030-25005-8\_3},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BaigKS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BalkoBMV19,
  author       = {Martin Balko and
                  Sujoy Bhore and
                  Leonardo Mart{\'{\i}}nez{-}Sandoval and
                  Pavel Valtr},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {On Erd{\H{o}}s-Szekeres-Type Problems for k-convex Point Sets},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {35--47},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_4},
  doi          = {10.1007/978-3-030-25005-8\_4},
  timestamp    = {Tue, 27 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/BalkoBMV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BanerjeeB19,
  author       = {Sandip Banerjee and
                  Sujoy Bhore},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Algorithm and Hardness Results on Liar's Dominating Set and {\textbackslash}varveck
                  -tuple Dominating Set},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {48--60},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_5},
  doi          = {10.1007/978-3-030-25005-8\_5},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BanerjeeB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BanikJP019,
  author       = {Aritra Banik and
                  Ashwin Jacob and
                  Vijay Kumar Paliwal and
                  Venkatesh Raman},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Fixed-Parameter Tractability of (n-k) List Coloring},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {61--69},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_6},
  doi          = {10.1007/978-3-030-25005-8\_6},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BanikJP019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BataaPALP19,
  author       = {Magsarjav Bataa and
                  Sung Gwan Park and
                  Amihood Amir and
                  Gad M. Landau and
                  Kunsoo Park},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Finding Periods in Cartesian Tree Matching},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {70--84},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_7},
  doi          = {10.1007/978-3-030-25005-8\_7},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BataaPALP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BentertHHKN19,
  author       = {Matthias Bentert and
                  Roman Haag and
                  Christian Hofer and
                  Tomohiro Koana and
                  Andr{\'{e}} Nichterlein},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Parameterized Complexity of Min-Power Asymmetric Connectivity},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {85--96},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_8},
  doi          = {10.1007/978-3-030-25005-8\_8},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BentertHHKN19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/Biswas0S19,
  author       = {Arindam Biswas and
                  Venkatesh Raman and
                  Saket Saurabh},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Solving Group Interval Scheduling Efficiently},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {97--107},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_9},
  doi          = {10.1007/978-3-030-25005-8\_9},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/Biswas0S19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BockenhauerBK19,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Nina Corvelo Benz and
                  Dennis Komm},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Call Admission Problems on Trees with Advice - (Extended Abstract)},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {108--121},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_10},
  doi          = {10.1007/978-3-030-25005-8\_10},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BockenhauerBK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BrlekFMPR19,
  author       = {Srecko Brlek and
                  Andrea Frosini and
                  Ilaria Mancini and
                  Elisa Pergola and
                  Simone Rinaldi},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Burrows-Wheeler Transform of Words Defined by Morphisms},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {393--404},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_32},
  doi          = {10.1007/978-3-030-25005-8\_32},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BrlekFMPR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/CazalsDCGW19,
  author       = {Pierre Cazals and
                  Beno{\^{\i}}t Darties and
                  Annie Chateau and
                  Rodolphe Giroudeau and
                  Mathias Weller},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {122--135},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_11},
  doi          = {10.1007/978-3-030-25005-8\_11},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/CazalsDCGW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/ChlebikovaD19,
  author       = {Janka Chleb{\'{\i}}kov{\'{a}} and
                  Cl{\'{e}}ment Dallard},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Towards a Complexity Dichotomy for Colourful Components Problems on
                  k-caterpillars and Small-Degree Planar Graphs},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {136--147},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_12},
  doi          = {10.1007/978-3-030-25005-8\_12},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/ChlebikovaD19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/ConteKMU19,
  author       = {Alessio Conte and
                  Mamadou Moustapha Kant{\'{e}} and
                  Andrea Marino and
                  Takeaki Uno},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree
                  Hypergraphs},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {148--159},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_13},
  doi          = {10.1007/978-3-030-25005-8\_13},
  timestamp    = {Sun, 18 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/ConteKMU19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/CordascoGR19,
  author       = {Gennaro Cordasco and
                  Luisa Gargano and
                  Adele Anna Rescigno},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Dual Domination},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {160--174},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_14},
  doi          = {10.1007/978-3-030-25005-8\_14},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/CordascoGR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/DonovanSM19,
  author       = {Zola Donovan and
                  K. Subramani and
                  Vahan Mkrtchyan},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Disjoint Clustering in Combinatorial Circuits},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {201--213},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_17},
  doi          = {10.1007/978-3-030-25005-8\_17},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/DonovanSM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/DouradoPR19,
  author       = {Mitre Costa Dourado and
                  Lucia Draque Penso and
                  Dieter Rautenbach},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {The Hull Number in the Convexity of Induced Paths of Order 3},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {214--228},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_18},
  doi          = {10.1007/978-3-030-25005-8\_18},
  timestamp    = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/DouradoPR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/FroncekQ19,
  author       = {Dalibor Froncek and
                  Jiangyi Qiu},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Supermagic Graphs with Many Odd Degrees},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {229--236},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_19},
  doi          = {10.1007/978-3-030-25005-8\_19},
  timestamp    = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/FroncekQ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/GhadikolaeiMMP19,
  author       = {Mehdi Khosravian Ghadikolaei and
                  Nikolaos Melissinos and
                  J{\'{e}}r{\^{o}}me Monnot and
                  Aris Pagourtzis},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Extension and Its Price for the Connected Vertex Cover Problem},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {315--326},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_26},
  doi          = {10.1007/978-3-030-25005-8\_26},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/GhadikolaeiMMP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/GuptaK19,
  author       = {Rahul Raj Gupta and
                  Sushanta Karmakar},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {237--250},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_20},
  doi          = {10.1007/978-3-030-25005-8\_20},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/GuptaK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/HabibMMZ19,
  author       = {Michel Habib and
                  Fabien de Montgolfier and
                  Lalla Mouatadid and
                  Mengchuan Zou},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {A General Algorithmic Scheme for Modular Decompositions of Hypergraphs
                  and Applications},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {251--264},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_21},
  doi          = {10.1007/978-3-030-25005-8\_21},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/HabibMMZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/HaverkortKL19,
  author       = {Herman J. Haverkort and
                  David K{\"{u}}bel and
                  Elmar Langetepe},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Shortest-Path-Preserving Rounding},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {265--277},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_22},
  doi          = {10.1007/978-3-030-25005-8\_22},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/HaverkortKL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/HenningPT19,
  author       = {Michael A. Henning and
                  Arti Pandey and
                  Vikash Tripathi},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Complexity and Algorithms for Semipaired Domination in Graphs},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {278--289},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_23},
  doi          = {10.1007/978-3-030-25005-8\_23},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/HenningPT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/JanssonMRS19,
  author       = {Jesper Jansson and
                  Konstantinos Mampentzidis and
                  Ramesh Rajaby and
                  Wing{-}Kin Sung},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Computing the Rooted Triplet Distance Between Phylogenetic Networks},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {290--303},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_24},
  doi          = {10.1007/978-3-030-25005-8\_24},
  timestamp    = {Tue, 17 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/JanssonMRS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/KareR19,
  author       = {Anjeneya Swami Kare and
                  I. Vinod Reddy},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Parameterized Algorithms for Graph Burning Problem},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {304--314},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_25},
  doi          = {10.1007/978-3-030-25005-8\_25},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/KareR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/KobayashiKMT19,
  author       = {Yasuaki Kobayashi and
                  Yusuke Kobayashi and
                  Shuichi Miyazaki and
                  Suguru Tamaki},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by
                  Crossing Number},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {327--338},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_27},
  doi          = {10.1007/978-3-030-25005-8\_27},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/KobayashiKMT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/KuritaWUA19,
  author       = {Kazuhiro Kurita and
                  Kunihiro Wasa and
                  Takeaki Uno and
                  Hiroki Arimura},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs
                  in Sparse Graphs},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {339--351},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_28},
  doi          = {10.1007/978-3-030-25005-8\_28},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/KuritaWUA19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/LauriM19,
  author       = {Juho Lauri and
                  Christodoulos Mitillos},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Complexity of Fall Coloring for Restricted Graph Classes},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {352--364},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_29},
  doi          = {10.1007/978-3-030-25005-8\_29},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/LauriM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/LozzoR19,
  author       = {Giordano Da Lozzo and
                  Ignaz Rutter},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Reaching 3-Connectivity via Edge-Edge Additions},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {175--187},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_15},
  doi          = {10.1007/978-3-030-25005-8\_15},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/LozzoR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/MiyakeTH19,
  author       = {Fumito Miyake and
                  Eiji Takimoto and
                  Kohei Hatano},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Succinct Representation of Linear Extensions via MDDs and Its Application
                  to Scheduling Under Precedence Constraints},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {365--377},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_30},
  doi          = {10.1007/978-3-030-25005-8\_30},
  timestamp    = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/MiyakeTH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/PlantM19,
  author       = {Lachlan Plant and
                  Lucia Moura},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Maximum Clique Exhaustive Search in Circulant k-Hypergraphs},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {378--392},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_31},
  doi          = {10.1007/978-3-030-25005-8\_31},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/PlantM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/PrajeeshPK19,
  author       = {Appattu Vallapil Prajeesh and
                  Krishnan Paramasivam and
                  Nainarraj Kamatchi},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {A Note on Handicap Incomplete Tournaments},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {1--9},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_1},
  doi          = {10.1007/978-3-030-25005-8\_1},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/PrajeeshPK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/RuangwisesI19,
  author       = {Suthee Ruangwises and
                  Toshiya Itoh},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Stable Noncrossing Matchings},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {405--416},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_33},
  doi          = {10.1007/978-3-030-25005-8\_33},
  timestamp    = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/RuangwisesI19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/StoberW19,
  author       = {Florian Stober and
                  Armin Wei{\ss}},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {On the Average Case of MergeInsertion},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {417--429},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_34},
  doi          = {10.1007/978-3-030-25005-8\_34},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/StoberW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/WatanabeNIBT19,
  author       = {Kiichi Watanabe and
                  Yuto Nakashima and
                  Shunsuke Inenaga and
                  Hideo Bannai and
                  Masayuki Takeda},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Shortest Unique Palindromic Substring Queries on Run-Length Encoded
                  Strings},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {430--441},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_35},
  doi          = {10.1007/978-3-030-25005-8\_35},
  timestamp    = {Mon, 24 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/WatanabeNIBT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/XueYZZ19,
  author       = {Yuan Xue and
                  Boting Yang and
                  Farong Zhong and
                  Sandra Zilles},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {A Partition Approach to Lower Bounds for Zero-Visibility Cops and
                  Robber},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {442--454},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_36},
  doi          = {10.1007/978-3-030-25005-8\_36},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/XueYZZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/iwoca/2019,
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8},
  doi          = {10.1007/978-3-030-25005-8},
  isbn         = {978-3-030-25004-1},
  timestamp    = {Mon, 15 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/2019.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.