Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:streams/conf/ciac:"
download as .bib file
@inproceedings{DBLP:conf/ciac/AlekseevH23,
author = {Yaroslav Alekseev and
Edward A. Hirsch},
editor = {Marios Mavronicolas},
title = {The Power of the Binary Value Principle},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {21--36},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_3},
doi = {10.1007/978-3-031-30448-4\_3},
timestamp = {Fri, 28 Apr 2023 19:21:51 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AlekseevH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AsahiroEKLMN23,
author = {Yuichi Asahiro and
Hiroshi Eto and
Kana Korenaga and
Guohui Lin and
Eiji Miyano and
Reo Nonoue},
editor = {Marios Mavronicolas},
title = {Independent Set Under a Change Constraint from an Initial Solution},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {37--51},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_4},
doi = {10.1007/978-3-031-30448-4\_4},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AsahiroEKLMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AttiyaS23,
author = {Hagit Attiya and
Noa Schiller},
editor = {Marios Mavronicolas},
title = {Asynchronous Fully-Decentralized {SGD} in the Cluster-Based Model},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {52--66},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_5},
doi = {10.1007/978-3-031-30448-4\_5},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AttiyaS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BalzottiF23,
author = {Lorenzo Balzotti and
Paolo Giulio Franciosa},
editor = {Marios Mavronicolas},
title = {Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {67--81},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_6},
doi = {10.1007/978-3-031-30448-4\_6},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BalzottiF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BalzottiF23a,
author = {Lorenzo Balzotti and
Paolo Giulio Franciosa},
editor = {Marios Mavronicolas},
title = {How Vulnerable is an Undirected Planar Graph with Respect to Max Flow},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {82--96},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_7},
doi = {10.1007/978-3-031-30448-4\_7},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BalzottiF23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BenNunGHO23,
author = {Tal Ben{-}Nun and
Lukas Gianinazzi and
Torsten Hoefler and
Yishai Oltchik},
editor = {Marios Mavronicolas},
title = {Maximum Flows in Parametric Graph Templates},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {97--111},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_8},
doi = {10.1007/978-3-031-30448-4\_8},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BenNunGHO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BhyravarapuKR23,
author = {Sriram Bhyravarapu and
Swati Kumari and
I. Vinod Reddy},
editor = {Marios Mavronicolas},
title = {Dynamic Coloring on Restricted Graph Classes},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {112--126},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_9},
doi = {10.1007/978-3-031-30448-4\_9},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BhyravarapuKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BlasiusFW23,
author = {Thomas Bl{\"{a}}sius and
Adrian Feilhauer and
Jannik Westenfelder},
editor = {Marios Mavronicolas},
title = {Dynamic Flows with Time-Dependent Capacities},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {142--156},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_11},
doi = {10.1007/978-3-031-30448-4\_11},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BlasiusFW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BliznetsST23,
author = {Ivan Bliznets and
Danil Sagunov and
Eugene Tagin},
editor = {Marios Mavronicolas},
title = {Enumeration of Minimal Tropical Connected Sets},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {127--141},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_10},
doi = {10.1007/978-3-031-30448-4\_10},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BliznetsST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Bshouty23,
author = {Nader H. Bshouty},
editor = {Marios Mavronicolas},
title = {On One-Sided Testing Affine Subspaces},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {157--171},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_12},
doi = {10.1007/978-3-031-30448-4\_12},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Bshouty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BuschCKP23,
author = {Costas Busch and
Bogdan S. Chlebus and
Dariusz R. Kowalski and
Pavan Poudel},
editor = {Marios Mavronicolas},
title = {Stable Scheduling in Transactional Memory},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {172--186},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_13},
doi = {10.1007/978-3-031-30448-4\_13},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BuschCKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CastenowHH23,
author = {Jannik Castenow and
Jonas Harbig and
Friedhelm Meyer auf der Heide},
editor = {Marios Mavronicolas},
title = {Unifying Gathering Protocols for Swarms of Mobile Robots},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {5--16},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_1},
doi = {10.1007/978-3-031-30448-4\_1},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CastenowHH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FernauFMPN23,
author = {Henning Fernau and
Florent Foucaud and
Kevin Mann and
Utkarsh Padariya and
Rajath Rao K. N},
editor = {Marios Mavronicolas},
title = {Parameterizing Path Partitions},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {187--201},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_14},
doi = {10.1007/978-3-031-30448-4\_14},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FernauFMPN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FinkR23,
author = {Simon D. Fink and
Ignaz Rutter},
editor = {Marios Mavronicolas},
title = {Maintaining Triconnected Components Under Node Expansion},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {202--216},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_15},
doi = {10.1007/978-3-031-30448-4\_15},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FinkR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FujitoMT23,
author = {Toshihiro Fujito and
Kneto Mukae and
Junya Tsuzuki},
editor = {Marios Mavronicolas},
title = {Approximating Power Node-Deletion Problems},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {217--231},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_16},
doi = {10.1007/978-3-031-30448-4\_16},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FujitoMT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FusyK23,
author = {{\'{E}}ric Fusy and
Gregory Kucherov},
editor = {Marios Mavronicolas},
title = {Phase Transition in Count Approximation by Count-Min Sketch with Conservative
Updates},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {232--246},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_17},
doi = {10.1007/978-3-031-30448-4\_17},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FusyK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GevaKMP23,
author = {Kerem Geva and
Matthew J. Katz and
Joseph S. B. Mitchell and
Eli Packer},
editor = {Marios Mavronicolas},
title = {Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the
Plane},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {247--262},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_18},
doi = {10.1007/978-3-031-30448-4\_18},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GevaKMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HanakaOOU23,
author = {Tesshu Hanaka and
Hirotaka Ono and
Yota Otachi and
Saeki Uda},
editor = {Marios Mavronicolas},
title = {Grouped Domination Parameterized by Vertex Cover, Twin Cover, and
Beyond},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {263--277},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_19},
doi = {10.1007/978-3-031-30448-4\_19},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/HanakaOOU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HarutyunyanH23,
author = {Hovhannes A. Harutyunyan and
Narek A. Hovhannisyan},
editor = {Marios Mavronicolas},
title = {Broadcasting in Split Graphs},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {278--292},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_20},
doi = {10.1007/978-3-031-30448-4\_20},
timestamp = {Sun, 19 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/HarutyunyanH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/JanaSSSV23,
author = {Satyabrata Jana and
Souvik Saha and
Abhishek Sahu and
Saket Saurabh and
Shaily Verma},
editor = {Marios Mavronicolas},
title = {Partitioning Subclasses of Chordal Graphs with Few Deletions},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {293--307},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_21},
doi = {10.1007/978-3-031-30448-4\_21},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/JanaSSSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KoiranS23,
author = {Pascal Koiran and
Subhayan Saha},
editor = {Marios Mavronicolas},
title = {Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic
Precision},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {308--322},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_22},
doi = {10.1007/978-3-031-30448-4\_22},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KoiranS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KumarMS23,
author = {Manish Kumar and
Anisur Rahaman Molla and
Sumathi Sivasubramaniam},
editor = {Marios Mavronicolas},
title = {Improved Deterministic Leader Election in Diameter-Two Networks},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {323--335},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_23},
doi = {10.1007/978-3-031-30448-4\_23},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KumarMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/PanGLZ23,
author = {Victor Y. Pan and
Soo Go and
Qi Luan and
Liang Zhao},
editor = {Marios Mavronicolas},
title = {Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {336--352},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_24},
doi = {10.1007/978-3-031-30448-4\_24},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/PanGLZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Persiano23,
author = {Giuseppe Persiano},
editor = {Marios Mavronicolas},
title = {The Complexity of Secure RAMs},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {17--20},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_2},
doi = {10.1007/978-3-031-30448-4\_2},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Persiano23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SamFRG23,
author = {Emmanuel Sam and
Michael R. Fellows and
Frances A. Rosamond and
Petr A. Golovach},
editor = {Marios Mavronicolas},
title = {On the Parameterized Complexity of the Structure of Lineal Topologies
(Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {353--367},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_25},
doi = {10.1007/978-3-031-30448-4\_25},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SamFRG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SpirakisNR23,
author = {Paul G. Spirakis and
Sotiris E. Nikoletseas and
Christoforos L. Raptopoulos},
editor = {Marios Mavronicolas},
title = {Selected Combinatorial Problems Through the Prism of Random Intersection
Graphs Models},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {1--4},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_28},
doi = {10.1007/978-3-031-30448-4\_28},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SpirakisNR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/YanhaonaNR23,
author = {Muhammad Nur Yanhaona and
Asswad Sarker Nomaan and
Md. Saidur Rahman},
editor = {Marios Mavronicolas},
title = {Efficiently Enumerating All Spanning Trees of a Plane 3-Tree - (Extended
Abstract)},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {368--382},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_26},
doi = {10.1007/978-3-031-30448-4\_26},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/YanhaonaNR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Zhu23,
author = {Chun Jiang Zhu},
editor = {Marios Mavronicolas},
title = {Communication-Efficient Distributed Graph Clustering and Sparsification
Under Duplication Models},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {383--398},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_27},
doi = {10.1007/978-3-031-30448-4\_27},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Zhu23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2023,
editor = {Marios Mavronicolas},
title = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4},
doi = {10.1007/978-3-031-30448-4},
isbn = {978-3-031-30447-7},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/0001KR0S21,
author = {Pallavi Jain and
Lawqueen Kanesh and
Shivesh Kumar Roy and
Saket Saurabh and
Roohani Sharma},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Circumventing Connectivity for Kernelization},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {300--313},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_21},
doi = {10.1007/978-3-030-75242-2\_21},
timestamp = {Thu, 06 May 2021 09:40:55 +0200},
biburl = {https://dblp.org/rec/conf/ciac/0001KR0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/0001MS21,
author = {Martin B{\"{o}}hm and
Nicole Megow and
Jens Schl{\"{o}}ter},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Throughput Scheduling with Equal Additive Laxity},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {130--143},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_9},
doi = {10.1007/978-3-030-75242-2\_9},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/0001MS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AhnJKL21,
author = {Jungho Ahn and
Lars Jaffke and
O{-}joung Kwon and
Paloma T. Lima},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Three Problems on Well-Partitioned Chordal Graphs},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {23--36},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_2},
doi = {10.1007/978-3-030-75242-2\_2},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AhnJKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AkitayaKKST21,
author = {Hugo A. Akitaya and
Matias Korman and
Oliver Korten and
Diane L. Souvaine and
Csaba D. T{\'{o}}th},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Reconfiguration of Connected Graph Partitions via Recombination},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {61--74},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_4},
doi = {10.1007/978-3-030-75242-2\_4},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AkitayaKKST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AlbersQ21,
author = {Susanne Albers and
Jens Quedenfeld},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Algorithms for Energy Conservation in Heterogeneous Data Centers},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {75--89},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_5},
doi = {10.1007/978-3-030-75242-2\_5},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AlbersQ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AmiriW21,
author = {Saeed Akhoondian Amiri and
Ben Wiederhake},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Distributed Distance-r Covering Problems on Sparse High-Girth Graphs},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {37--60},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_3},
doi = {10.1007/978-3-030-75242-2\_3},
timestamp = {Thu, 06 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AmiriW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Bar-NoyBPR21,
author = {Amotz Bar{-}Noy and
Toni B{\"{o}}hnlein and
David Peleg and
Dror Rawitz},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {On Vertex-Weighted Graph Realizations},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {90--102},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_6},
doi = {10.1007/978-3-030-75242-2\_6},
timestamp = {Thu, 06 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Bar-NoyBPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BensmailFI21,
author = {Julien Bensmail and
Foivos Fioravantes and
Fionn Mc Inerney},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {On the Role of 3's for the 1-2-3 Conjecture},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {103--115},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_7},
doi = {10.1007/978-3-030-75242-2\_7},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BensmailFI21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BerceaE21,
author = {Ioana O. Bercea and
Guy Even},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Upper Tail Analysis of Bucket Sort and Random Tries},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {116--129},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_8},
doi = {10.1007/978-3-030-75242-2\_8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BerceaE21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BoseCFIJL21,
author = {Prosenjit Bose and
Pilar Cano and
Rolf Fagerberg and
John Iacono and
Riko Jacob and
Stefan Langerman},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Fragile Complexity of Adaptive Algorithms},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {144--157},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_10},
doi = {10.1007/978-3-030-75242-2\_10},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BoseCFIJL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaselFGMS21,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Abundant Extensions},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {3--17},
publisher = {Springer},
year = {2021},
timestamp = {Thu, 25 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CaselFGMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CellineseDMV21,
author = {Francesco Cellinese and
Gianlorenzo D'Angelo and
Gianpiero Monaco and
Yllka Velaj},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {The Multi-budget Maximum Weighted Coverage Problem},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {173--186},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_12},
doi = {10.1007/978-3-030-75242-2\_12},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CellineseDMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChaplickKKR021,
author = {Steven Chaplick and
Philipp Kindermann and
Jonathan Klawitter and
Ignaz Rutter and
Alexander Wolff},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Extending Partial Representations of Rectangular Duals with Given
Contact Orientations},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {340--353},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_24},
doi = {10.1007/978-3-030-75242-2\_24},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChaplickKKR021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Chitnis21,
author = {Rajesh Chitnis},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {187--201},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_13},
doi = {10.1007/978-3-030-75242-2\_13},
timestamp = {Thu, 06 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Chitnis21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DubloisLP21,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential
Approximation},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {202--215},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_14},
doi = {10.1007/978-3-030-75242-2\_14},
timestamp = {Thu, 06 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DubloisLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FigielHNN21,
author = {Aleksander Figiel and
Anne{-}Sophie Himmel and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {216--230},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_15},
doi = {10.1007/978-3-030-75242-2\_15},
timestamp = {Thu, 06 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FigielHNN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Fluschnik21,
author = {Till Fluschnik},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {A Multistage View on 2-Satisfiability},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {231--244},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_16},
doi = {10.1007/978-3-030-75242-2\_16},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Fluschnik21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FuhlbruckKPV21,
author = {Frank Fuhlbr{\"{u}}ck and
Johannes K{\"{o}}bler and
Ilia Ponomarenko and
Oleg Verbitsky},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {The Weisfeiler-Leman Algorithm and Recognition of Graph Properties},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {245--257},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_17},
doi = {10.1007/978-3-030-75242-2\_17},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FuhlbruckKPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FujisatoNIBT21,
author = {Noriki Fujisato and
Yuto Nakashima and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {The Parameterized Suffix Tray},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {258--270},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_18},
doi = {10.1007/978-3-030-75242-2\_18},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FujisatoNIBT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GimaHKKO21,
author = {Tatsuya Gima and
Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yota Otachi},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Exploring the Gap Between Treedepth and Vertex Cover Through Vertex
Integrity},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {271--285},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_19},
doi = {10.1007/978-3-030-75242-2\_19},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GimaHKKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GomesSSS21,
author = {Guilherme de Castro Mendes Gomes and
Vin{\'{\i}}cius Fernandes dos Santos and
Murilo V. G. da Silva and
Jayme Luiz Szwarcfiter},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {{FPT} and Kernelization Algorithms for the Induced Tree Problem},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {158--172},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_11},
doi = {10.1007/978-3-030-75242-2\_11},
timestamp = {Mon, 17 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GomesSSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GudmundssonKRSW21,
author = {Joachim Gudmundsson and
Mees van de Kerkhof and
Andr{\'{e}} van Renssen and
Frank Staals and
Lionov Wiratma and
Sampson Wong},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Covering a Set of Line Segments with a Few Squares},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {286--299},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_20},
doi = {10.1007/978-3-030-75242-2\_20},
timestamp = {Thu, 06 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GudmundssonKRSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Huber21,
author = {Katharina T. Huber},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Phylogenetic Networks, {A} Way to Cope with Complex Evolutionary Processes},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {18},
publisher = {Springer},
year = {2021},
timestamp = {Thu, 25 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Huber21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/JanssonLL21,
author = {Jesper Jansson and
Christos Levcopoulos and
Andrzej Lingas},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Online and Approximate Network Construction from Bounded Connectivity
Constraints},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {314--325},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_22},
doi = {10.1007/978-3-030-75242-2\_22},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/JanssonLL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KiralyM21,
author = {Csaba Kir{\'{a}}ly and
Andr{\'{a}}s Mih{\'{a}}lyk{\'{o}}},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Globally Rigid Augmentation of Minimally Rigid Graphs in R\({}^{\mbox{2}}\)},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {326--339},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_23},
doi = {10.1007/978-3-030-75242-2\_23},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KiralyM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KomusiewiczM21,
author = {Christian Komusiewicz and
Nils Morawietz},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Can Local Optimality Be Used for Efficient Data Reduction?},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {354--366},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_25},
doi = {10.1007/978-3-030-75242-2\_25},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KomusiewiczM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MartinPS21,
author = {Barnaby Martin and
Dani{\"{e}}l Paulusma and
Siani Smith},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Colouring Graphs of Bounded Diameter in the Absence of Small Cycles},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {367--380},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_26},
doi = {10.1007/978-3-030-75242-2\_26},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/MartinPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Naor21,
author = {Joseph (Seffi) Naor},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Recent Advances in Competitive Analysis of Online Algorithms},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {19},
publisher = {Springer},
year = {2021},
timestamp = {Thu, 25 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Naor21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/NilssonV21,
author = {Bengt J. Nilsson and
Gordana Vujovic},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Online Two-Dimensional Vector Packing With Advice},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {381--393},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_27},
doi = {10.1007/978-3-030-75242-2\_27},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/NilssonV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/PicavetNB21,
author = {Timoth{\'{e}} Picavet and
Ngoc{-}Trung Nguyen and
Binh{-}Minh Bui{-}Xuan},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Temporal Matching on Geometric Graph Data},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {394--408},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_28},
doi = {10.1007/978-3-030-75242-2\_28},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/PicavetNB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/X21,
author = {Henning Fernau and
Katharina T. Huber and
Joseph (Seffi) Naor},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Invited Talks},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {3--19},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_1},
doi = {10.1007/978-3-030-75242-2\_1},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2021,
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2},
doi = {10.1007/978-3-030-75242-2},
isbn = {978-3-030-75241-5},
timestamp = {Thu, 06 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AgrawalG0019,
author = {Akanksha Agrawal and
Sushmita Gupta and
Pallavi Jain and
R. Krithika},
editor = {Pinar Heggernes},
title = {Quadratic Vertex Kernel for Split Vertex Deletion},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {1--12},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_1},
doi = {10.1007/978-3-030-17402-6\_1},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/AgrawalG0019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AkridaMS19,
author = {Eleni C. Akrida and
George B. Mertzios and
Paul G. Spirakis},
editor = {Pinar Heggernes},
title = {The Temporal Explorer Who Returns to the Base},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {13--24},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_2},
doi = {10.1007/978-3-030-17402-6\_2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/AkridaMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BarbozaSR19,
author = {Allan S. Barboza and
Cid C. de Souza and
Pedro J. de Rezende},
editor = {Pinar Heggernes},
title = {Minimum Convex Partition of Point Sets},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {25--37},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_3},
doi = {10.1007/978-3-030-17402-6\_3},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BarbozaSR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BelmonteHKLOO19,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
editor = {Pinar Heggernes},
title = {Parameterized Complexity of Safe Set},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {38--49},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_4},
doi = {10.1007/978-3-030-17402-6\_4},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BelmonteHKLOO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BentertN19,
author = {Matthias Bentert and
Andr{\'{e}} Nichterlein},
editor = {Pinar Heggernes},
title = {Parameterized Complexity of Diameter},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {50--61},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_5},
doi = {10.1007/978-3-030-17402-6\_5},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BentertN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BevernTZ19,
author = {Ren{\'{e}} van Bevern and
Oxana Yu. Tsidulko and
Philipp Zschoche},
editor = {Pinar Heggernes},
title = {Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under
Matroid Constraints},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {62--74},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_6},
doi = {10.1007/978-3-030-17402-6\_6},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BevernTZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BiloGM19,
author = {Vittorio Bil{\`{o}} and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Pinar Heggernes},
title = {Project Games},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {75--86},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_7},
doi = {10.1007/978-3-030-17402-6\_7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BiloGM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BodlaenderHOOZ19,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Yoshio Okamoto and
Yota Otachi and
Tom C. van der Zanden},
editor = {Pinar Heggernes},
title = {Subgraph Isomorphism on Graph Classes that Exclude a Substructure},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {87--98},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_8},
doi = {10.1007/978-3-030-17402-6\_8},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BodlaenderHOOZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BulteauGKS19,
author = {Laurent Bulteau and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Manuel Sorge},
editor = {Pinar Heggernes},
title = {Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure
with Edge Colors},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {99--111},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_9},
doi = {10.1007/978-3-030-17402-6\_9},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BulteauGKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaiDHS19,
author = {Xing Shi Cai and
Luc Devroye and
Cecilia Holmgren and
Fiona Skerman},
editor = {Pinar Heggernes},
title = {k -cuts on a Path},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {112--123},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_10},
doi = {10.1007/978-3-030-17402-6\_10},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CaiDHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaselFGMS19,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
editor = {Pinar Heggernes},
title = {Extension of Vertex Cover and Independent Set in Some Classes of Graphs},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {124--136},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_11},
doi = {10.1007/978-3-030-17402-6\_11},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CaselFGMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaskurluK19,
author = {Bugra {\c{C}}askurlu and
Fatih Erdem Kizilkaya},
editor = {Pinar Heggernes},
title = {On Hedonic Games with Common Ranking Property},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {137--148},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_12},
doi = {10.1007/978-3-030-17402-6\_12},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CaskurluK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChlebikovaDP19,
author = {Janka Chleb{\'{\i}}kov{\'{a}} and
Cl{\'{e}}ment Dallard and
Niklas Paulsen},
editor = {Pinar Heggernes},
title = {Complexity of Scheduling for {DARP} with Soft Ride Times},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {149--160},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_13},
doi = {10.1007/978-3-030-17402-6\_13},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChlebikovaDP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Choudhary0KS19,
author = {Pratibha Choudhary and
Pallavi Jain and
R. Krithika and
Vibha Sahlot},
editor = {Pinar Heggernes},
title = {Vertex Deletion on Split Graphs: Beyond 4-Hitting Set},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {161--173},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_14},
doi = {10.1007/978-3-030-17402-6\_14},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Choudhary0KS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CiceroneSGJNRS19,
author = {Serafino Cicerone and
Gabriele Di Stefano and
Leszek Gasieniec and
Tomasz Jurdzinski and
Alfredo Navarra and
Tomasz Radzik and
Grzegorz Stachowiak},
editor = {Pinar Heggernes},
title = {Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency
Requirements},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {174--186},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_15},
doi = {10.1007/978-3-030-17402-6\_15},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CiceroneSGJNRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DereniowskiKO19,
author = {Dariusz Dereniowski and
Lukasz Kuszner and
Robert Ostrowski},
editor = {Pinar Heggernes},
title = {Searching by Heterogeneous Agents},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {199--211},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_17},
doi = {10.1007/978-3-030-17402-6\_17},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DereniowskiKO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Dumitrescu19,
author = {Adrian Dumitrescu},
editor = {Pinar Heggernes},
title = {Finding a Mediocre Player},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {212--223},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_18},
doi = {10.1007/978-3-030-17402-6\_18},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Dumitrescu19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FeketeK19,
author = {S{\'{a}}ndor P. Fekete and
Dominik Krupke},
editor = {Pinar Heggernes},
title = {Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {224--236},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_19},
doi = {10.1007/978-3-030-17402-6\_19},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FeketeK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FujisatoNIBT19,
author = {Noriki Fujisato and
Yuto Nakashima and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
editor = {Pinar Heggernes},
title = {The Parameterized Position Heap of a Trie},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {237--248},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_20},
doi = {10.1007/978-3-030-17402-6\_20},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FujisatoNIBT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GokeMM19,
author = {Alexander G{\"{o}}ke and
D{\'{a}}niel Marx and
Matthias Mnich},
editor = {Pinar Heggernes},
title = {Parameterized Algorithms for Generalizations of Directed Feedback
Vertex Set},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {249--261},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_21},
doi = {10.1007/978-3-030-17402-6\_21},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/GokeMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GonzalezC19,
author = {Miguel Coviello Gonzalez and
Marek Chrobak},
editor = {Pinar Heggernes},
title = {Towards a Theory of Mixing Graphs: {A} Characterization of Perfect
Mixability (Extended Abstract)},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {187--198},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_16},
doi = {10.1007/978-3-030-17402-6\_16},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GonzalezC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HoangKU19,
author = {Duc A. Hoang and
Amanj Khorramian and
Ryuhei Uehara},
editor = {Pinar Heggernes},
title = {Shortest Reconfiguration Sequence for Sliding Tokens on Spiders},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {262--273},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_22},
doi = {10.1007/978-3-030-17402-6\_22},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HoangKU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/InerneyNP19,
author = {Fionn Mc Inerney and
Nicolas Nisse and
St{\'{e}}phane P{\'{e}}rennes},
editor = {Pinar Heggernes},
title = {Eternal Domination in Grids},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {311--322},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_26},
doi = {10.1007/978-3-030-17402-6\_26},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/InerneyNP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Johnson19,
author = {Matthew P. Johnson},
editor = {Pinar Heggernes},
title = {Turing Tumble Is P(SPACE)-Complete},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {274--285},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_23},
doi = {10.1007/978-3-030-17402-6\_23},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Johnson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KammerS19,
author = {Frank Kammer and
Andrej Sajenko},
editor = {Pinar Heggernes},
title = {Linear-Time In-Place {DFS} and {BFS} on the Word {RAM}},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {286--298},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_24},
doi = {10.1007/978-3-030-17402-6\_24},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KammerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Kunysz19,
author = {Adam Kunysz},
editor = {Pinar Heggernes},
title = {A Faster Algorithm for the Strongly Stable b-Matching Problem},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {299--310},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_25},
doi = {10.1007/978-3-030-17402-6\_25},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Kunysz19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/NataleR19,
author = {Emanuele Natale and
Iliad Ramezani},
editor = {Pinar Heggernes},
title = {On the Necessary Memory to Compute the Plurality in Multi-agent Systems},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {323--338},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_27},
doi = {10.1007/978-3-030-17402-6\_27},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/NataleR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/PangC19,
author = {Ho Lam Pang and
Leizhen Cai},
editor = {Pinar Heggernes},
title = {Complexity of Vertex Switching on Edge-Bicolored Graphs},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {339--351},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_28},
doi = {10.1007/978-3-030-17402-6\_28},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/PangC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/PennaV19,
author = {Paolo Penna and
Laurent Viennot},
editor = {Pinar Heggernes},
title = {Independent Lazy Better-Response Dynamics on Network Games},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {352--364},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_29},
doi = {10.1007/978-3-030-17402-6\_29},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/PennaV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/PhilipR0T19,
author = {Geevarghese Philip and
Varun Rajan and
Saket Saurabh and
Prafullkumar Tale},
editor = {Pinar Heggernes},
title = {Subset Feedback Vertex Set in Chordal and Split Graphs},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {365--376},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_30},
doi = {10.1007/978-3-030-17402-6\_30},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/PhilipR0T19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2019,
editor = {Pinar Heggernes},
title = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6},
doi = {10.1007/978-3-030-17402-6},
isbn = {978-3-030-17401-9},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Abed0DGMMRR17,
author = {Fidaa Abed and
Lin Chen and
Yann Disser and
Martin Gro{\ss} and
Nicole Megow and
Julie Mei{\ss}ner and
Alexander T. Richter and
Roman Rischke},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Scheduling Maintenance Jobs in Networks},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {19--30},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_3},
doi = {10.1007/978-3-319-57586-5\_3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Abed0DGMMRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AgrawalKST17,
author = {Akanksha Agrawal and
Lawqueen Kanesh and
Saket Saurabh and
Prafullkumar Tale},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Paths to Trees and Cacti},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {31--42},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_4},
doi = {10.1007/978-3-319-57586-5\_4},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/AgrawalKST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AkridaCGKS17,
author = {Eleni C. Akrida and
Jurek Czyzowicz and
Leszek Gasieniec and
Lukasz Kuszner and
Paul G. Spirakis},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Temporal Flows in Temporal Networks},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {43--54},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_5},
doi = {10.1007/978-3-319-57586-5\_5},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/AkridaCGKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BakaliCFFKMNPPP17,
author = {Eleni Bakali and
Panagiotis Cheilaris and
Dimitris Fotakis and
Martin F{\"{u}}rer and
Costas D. Koutras and
Euripides Markou and
Christos Nomikos and
Aris Pagourtzis and
Christos H. Papadimitriou and
Nikolaos S. Papaspyrou and
Katerina Potika},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Stathis Zachos at 70!},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {469--484},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_39},
doi = {10.1007/978-3-319-57586-5\_39},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BakaliCFFKMNPPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BakaliCPPZ17,
author = {Eleni Bakali and
Aggeliki Chalki and
Aris Pagourtzis and
Petros Pantavos and
Stathis Zachos},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Completeness Results for Counting Problems with Easy Decision},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {55--66},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_6},
doi = {10.1007/978-3-319-57586-5\_6},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BakaliCPPZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BanikKPS17,
author = {Aritra Banik and
Matthew J. Katz and
Eli Packer and
Marina Simakov},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Tracking Paths},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {67--79},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_7},
doi = {10.1007/978-3-319-57586-5\_7},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BanikKPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BazganPT17,
author = {Cristina Bazgan and
Thomas Pontoizeau and
Zsolt Tuza},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {On the Complexity of Finding a Potential Community},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {80--91},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_8},
doi = {10.1007/978-3-319-57586-5\_8},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BazganPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BodlaenderZ17,
author = {Hans L. Bodlaender and
Tom C. van der Zanden},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Improved Lower Bounds for Graph Embedding Problems},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {92--103},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_9},
doi = {10.1007/978-3-319-57586-5\_9},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BodlaenderZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BrandtLLSW17,
author = {Sebastian Brandt and
Felix Laufenberg and
Yuezhou Lv and
David Stolz and
Roger Wattenhofer},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Collaboration Without Communication: Evacuating Two Robots from a
Disk},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {104--115},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_10},
doi = {10.1007/978-3-319-57586-5\_10},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BrandtLLSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Brauer17,
author = {Sascha Brauer},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {116--127},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_11},
doi = {10.1007/978-3-319-57586-5\_11},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Brauer17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BredereckKKMNS17,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Assessing the Computational Complexity of Multi-layer Subgraph Detection},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {128--139},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_12},
doi = {10.1007/978-3-319-57586-5\_12},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BredereckKKMNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BshoutyG17,
author = {Nader H. Bshouty and
Ariel Gabizon},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Almost Optimal Cover-Free Families},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {140--151},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_13},
doi = {10.1007/978-3-319-57586-5\_13},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BshoutyG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChenHHKLW17,
author = {Li{-}Hsuan Chen and
Sun{-}Yuan Hsieh and
Ling{-}Ju Hung and
Ralf Klasing and
Chia{-}Wei Lee and
Bang Ye Wu},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {On the Complexity of the Star p-hub Center Problem with Parameterized
Triangle Inequality},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {152--163},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_14},
doi = {10.1007/978-3-319-57586-5\_14},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/ChenHHKLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CramptonGKW17,
author = {Jason Crampton and
Gregory Z. Gutin and
Martin Kouteck{\'{y}} and
R{\'{e}}mi Watrigant},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Parameterized Resiliency Problems via Integer Linear Programming},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {164--176},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_15},
doi = {10.1007/978-3-319-57586-5\_15},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CramptonGKW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CzyzowiczKKNOS17,
author = {Jurek Czyzowicz and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Linear Search with Terrain-Dependent Speeds},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {430--441},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_36},
doi = {10.1007/978-3-319-57586-5\_36},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CzyzowiczKKNOS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DemaineGL17,
author = {Erik D. Demaine and
Isaac Grosof and
Jayson Lynch},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Push-Pull Block Puzzles are Hard},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {177--195},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_16},
doi = {10.1007/978-3-319-57586-5\_16},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DemaineGL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DobrevKKLMNOSS17,
author = {Stefan Dobrev and
Evangelos Kranakis and
Danny Krizanc and
Manuel Lafond and
J{\'{a}}n Manuch and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende and
Ladislav Stacho},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Weak Coverage of a Rectangular Barrier},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {196--208},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_17},
doi = {10.1007/978-3-319-57586-5\_17},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/DobrevKKLMNOSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EmekSW17,
author = {Yuval Emek and
Yaacov Shapiro and
Yuyi Wang},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Minimum Cost Perfect Matching with Delays for Two Sources},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {209--221},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_18},
doi = {10.1007/978-3-319-57586-5\_18},
timestamp = {Fri, 07 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EmekSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FeldottoLS17,
author = {Matthias Feldotto and
Lennart Leder and
Alexander Skopalik},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Congestion Games with Complementarities},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {222--233},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_19},
doi = {10.1007/978-3-319-57586-5\_19},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/FeldottoLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FoersterGHKSW17,
author = {Klaus{-}Tycho Foerster and
Linus Groner and
Torsten Hoefler and
Michael K{\"{o}}nig and
Sascha Schmid and
Roger Wattenhofer},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial
Classification and Tight Algorithmic Bounds},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {247--259},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_21},
doi = {10.1007/978-3-319-57586-5\_21},
timestamp = {Mon, 30 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/FoersterGHKSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Fujito17,
author = {Toshihiro Fujito},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Approximating Bounded Degree Deletion via Matroid Matching},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {234--246},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_20},
doi = {10.1007/978-3-319-57586-5\_20},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Fujito17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Furer17,
author = {Martin F{\"{u}}rer},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {On the Combinatorial Power of the Weisfeiler-Lehman Algorithm},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {260--271},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_22},
doi = {10.1007/978-3-319-57586-5\_22},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Furer17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GairingKK17,
author = {Martin Gairing and
Konstantinos Kollias and
Grammateia Kotsialou},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Cost-Sharing in Generalised Selfish Routing},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {272--284},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_23},
doi = {10.1007/978-3-319-57586-5\_23},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GairingKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GeissmannG17,
author = {Barbara Geissmann and
Lukas Gianinazzi},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Cache Oblivious Minimum Cut},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {285--296},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_24},
doi = {10.1007/978-3-319-57586-5\_24},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GeissmannG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GoldbergP17,
author = {Paul W. Goldberg and
Christos H. Papadimitriou},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {{TFNP:} An Update},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {3--9},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_1},
doi = {10.1007/978-3-319-57586-5\_1},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GoldbergP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GolovachKS17,
author = {Petr A. Golovach and
Dieter Kratsch and
Mohamed Yosri Sayadi},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Enumeration of Maximal Irredundant Sets for Claw-Free Graphs},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {297--309},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_25},
doi = {10.1007/978-3-319-57586-5\_25},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/GolovachKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GourvesM17,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Approximate Maximin Share Allocations in Matroids},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {310--321},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_26},
doi = {10.1007/978-3-319-57586-5\_26},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GourvesM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HagerupKL17,
author = {Torben Hagerup and
Frank Kammer and
Moritz Laudahn},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Space-Efficient Euler Partition and Bipartite Edge Coloring},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {322--333},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_27},
doi = {10.1007/978-3-319-57586-5\_27},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HagerupKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HigashikawaIMSY17,
author = {Yuya Higashikawa and
Keiko Imai and
Yusuke Matsumoto and
Noriyoshi Sukegawa and
Yusuke Yokosuka},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Minimum Point-Overlap Labeling},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {334--344},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_28},
doi = {10.1007/978-3-319-57586-5\_28},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HigashikawaIMSY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/JaffkeJ17,
author = {Lars Jaffke and
Bart M. P. Jansen},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {345--356},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_29},
doi = {10.1007/978-3-319-57586-5\_29},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/JaffkeJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Jansen17,
author = {Klaus Jansen},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {New Algorithmic Results for Bin Packing and Scheduling},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {10--15},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_2},
doi = {10.1007/978-3-319-57586-5\_2},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Jansen17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/JansenMS17,
author = {Klaus Jansen and
Marten Maack and
Roberto Solis{-}Oba},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Structural Parameters for Scheduling with Assignment Restrictions},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {357--368},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_30},
doi = {10.1007/978-3-319-57586-5\_30},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/JansenMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Kisfaludi-BakZ17,
author = {S{\'{a}}ndor Kisfaludi{-}Bak and
Tom C. van der Zanden},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk
Graphs},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {369--380},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_31},
doi = {10.1007/978-3-319-57586-5\_31},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Kisfaludi-BakZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KleerS17,
author = {Pieter Kleer and
Guido Sch{\"{a}}fer},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion
Games},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {381--392},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_32},
doi = {10.1007/978-3-319-57586-5\_32},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KleerS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/LamprouMS17,
author = {Ioannis Lamprou and
Russell Martin and
Sven Schewe},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Perpetually Dominating Large Grids},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {393--404},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_33},
doi = {10.1007/978-3-319-57586-5\_33},
timestamp = {Tue, 22 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/LamprouMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/LunaFIISV17,
author = {Giuseppe Antonio Di Luna and
Paola Flocchini and
Taisuke Izumi and
Tomoko Izumi and
Nicola Santoro and
Giovanni Viglietta},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Population Protocols with Faulty Interactions: The Impact of a Leader},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {454--466},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_38},
doi = {10.1007/978-3-319-57586-5\_38},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/LunaFIISV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MastakasS17,
author = {Konstantinos Mastakas and
Antonios Symvonis},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Rooted Uniform Monotone Minimum Spanning Trees},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {405--417},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_34},
doi = {10.1007/978-3-319-57586-5\_34},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MastakasS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MelissourgosS17,
author = {Themistoklis Melissourgos and
Paul G. Spirakis},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Existence of Evolutionarily Stable Strategies Remains Hard to Decide
for a Wide Range of Payoff Values},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {418--429},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_35},
doi = {10.1007/978-3-319-57586-5\_35},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MelissourgosS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SekerHET17,
author = {Oylum Seker and
Pinar Heggernes and
T{\'{\i}}naz Ekim and
Z. Caner Taskin},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Linear-Time Generation of Random Chordal Graphs},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {442--453},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_37},
doi = {10.1007/978-3-319-57586-5\_37},
timestamp = {Fri, 17 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SekerHET17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2017,
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5},
doi = {10.1007/978-3-319-57586-5},
isbn = {978-3-319-57585-8},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Bar-NoyRT15,
author = {Amotz Bar{-}Noy and
Dror Rawitz and
Peter Terlecky},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {"Green" Barrier Coverage with Mobile Sensors},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {33--46},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_2},
doi = {10.1007/978-3-319-18173-8\_2},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Bar-NoyRT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BazganNN15,
author = {Cristina Bazgan and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {A Refined Complexity Analysis of Finding the Most Vital Edges for
Undirected Shortest Paths},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {47--60},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_3},
doi = {10.1007/978-3-319-18173-8\_3},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BazganNN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BlasiusLR15,
author = {Thomas Bl{\"{a}}sius and
Sebastian Lehmann and
Ignaz Rutter},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Orthogonal Graph Drawing with Inflexible Edges},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {61--73},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_4},
doi = {10.1007/978-3-319-18173-8\_4},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BlasiusLR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Bshouty15,
author = {Nader H. Bshouty},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Linear Time Constructions of Some d -Restriction Problems},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {74--88},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_5},
doi = {10.1007/978-3-319-18173-8\_5},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Bshouty15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CasteigtsKNP15,
author = {Arnaud Casteigts and
Ralf Klasing and
Yessin M. Neggaz and
Joseph G. Peters},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Efficiently Testing {T} -Interval Connectivity in Dynamic Graphs},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {89--100},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_6},
doi = {10.1007/978-3-319-18173-8\_6},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CasteigtsKNP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Chazelle15,
author = {Bernard Chazelle},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Communication, Dynamics, and Renormalization},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {1--32},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_1},
doi = {10.1007/978-3-319-18173-8\_1},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Chazelle15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChrobakDN15,
author = {Marek Chrobak and
Christoph D{\"{u}}rr and
Bengt J. Nilsson},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Competitive Strategies for Online Clique Clustering},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {101--113},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_7},
doi = {10.1007/978-3-319-18173-8\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChrobakDN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChrobakGLN15,
author = {Marek Chrobak and
Mordecai J. Golin and
Tak Wah Lam and
Dorian Nogneng},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Scheduling with Gaps: New Models and Algorithms},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {114--126},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_8},
doi = {10.1007/978-3-319-18173-8\_8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/ChrobakGLN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CiceroneSN15,
author = {Serafino Cicerone and
Gabriele Di Stefano and
Alfredo Navarra},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {MinMax-Distance Gathering on Given Meeting Points},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {127--139},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_9},
doi = {10.1007/978-3-319-18173-8\_9},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CiceroneSN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CzyzowiczGKNOV15,
author = {Jurek Czyzowicz and
Konstantinos Georgiou and
Evangelos Kranakis and
Lata Narayanan and
Jaroslav Opatrny and
Birgit Vogtenhuber},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Evacuating Robots from a Disk Using Face-to-Face Communication (Extended
Abstract)},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {140--152},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_10},
doi = {10.1007/978-3-319-18173-8\_10},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CzyzowiczGKNOV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DabrowskiP15,
author = {Konrad K. Dabrowski and
Dani{\"{e}}l Paulusma},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {167--181},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_12},
doi = {10.1007/978-3-319-18173-8\_12},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DabrowskiP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Damaschke15,
author = {Peter Damaschke},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Randomized Adaptive Test Cover},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {182--193},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_13},
doi = {10.1007/978-3-319-18173-8\_13},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Damaschke15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DinerPPR15,
author = {{\"{O}}znur Yasar Diner and
Dani{\"{e}}l Paulusma and
Christophe Picouleau and
Bernard Ries},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Contraction Blockers for Graphs with Forbidden Induced Paths},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {194--207},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_14},
doi = {10.1007/978-3-319-18173-8\_14},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/DinerPPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DuvillieBBDG15,
author = {Guillerme Duvilli{\'{e}} and
Marin Bougeret and
Vincent Boudet and
Trivikram Dokka and
Rodolphe Giroudeau},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {On the Complexity of Wafer-to-Wafer Integration},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {208--220},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_15},
doi = {10.1007/978-3-319-18173-8\_15},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DuvillieBBDG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GemsaNN15,
author = {Andreas Gemsa and
Benjamin Niedermann and
Martin N{\"{o}}llenburg},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Label Placement in Road Maps},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {221--234},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_16},
doi = {10.1007/978-3-319-18173-8\_16},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GemsaNN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HellersteinKL15,
author = {Lisa Hellerstein and
Devorah Kletenik and
Patrick Lin},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive
vs. Offline},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {235--248},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_17},
doi = {10.1007/978-3-319-18173-8\_17},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HellersteinKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KamatM15,
author = {Vikram Kamat and
Neeldhara Misra},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Parameterized Algorithms and Kernels for 3-Hitting Set with Parity
Constraints},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {249--260},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_18},
doi = {10.1007/978-3-319-18173-8\_18},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KamatM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KawamuraS15,
author = {Akitoshi Kawamura and
Makoto Soejima},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {261--273},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_19},
doi = {10.1007/978-3-319-18173-8\_19},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KawamuraS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KlimmS15,
author = {Max Klimm and
Daniel Schmand},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Sharing Non-anonymous Costs of Multiple Resources Optimally},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {274--287},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_20},
doi = {10.1007/978-3-319-18173-8\_20},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KlimmS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KratschL15,
author = {Dieter Kratsch and
Van Bang Le},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Algorithms Solving the Matching Cut Problem},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {288--299},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_21},
doi = {10.1007/978-3-319-18173-8\_21},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KratschL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KratschLM15,
author = {Dieter Kratsch and
Mathieu Liedloff and
Daniel Meister},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {End-Vertices of Graph Search Algorithms},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {300--312},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_22},
doi = {10.1007/978-3-319-18173-8\_22},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KratschLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Kudahl15,
author = {Christian Kudahl},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Deciding the On-line Chromatic Number of a Graph with Pre-coloring
Is PSPACE-Complete},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {313--324},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_23},
doi = {10.1007/978-3-319-18173-8\_23},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Kudahl15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/LaurentS15,
author = {Monique Laurent and
Matteo Seminaroti},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {A Lex-BFS-Based Recognition Algorithm for Robinsonian Matrices},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {325--338},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_24},
doi = {10.1007/978-3-319-18173-8\_24},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/LaurentS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/LofflerNS15,
author = {Maarten L{\"{o}}ffler and
Martin N{\"{o}}llenburg and
Frank Staals},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Mixed Map Labeling},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {339--351},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_25},
doi = {10.1007/978-3-319-18173-8\_25},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/LofflerNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/LozzoR15,
author = {Giordano Da Lozzo and
Ignaz Rutter},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Planarity of Streamed Graphs},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {153--166},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_11},
doi = {10.1007/978-3-319-18173-8\_11},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/LozzoR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Mikkelsen15,
author = {Jesper W. Mikkelsen},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Optimal Online Edge Coloring of Planar Graphs with Advice},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {352--364},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_26},
doi = {10.1007/978-3-319-18173-8\_26},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Mikkelsen15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MiyazakiMO15,
author = {Shuichi Miyazaki and
Naoyuki Morimoto and
Yasuo Okabe},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Approximability of Two Variants of Multiple Knapsack Problems},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {365--376},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_27},
doi = {10.1007/978-3-319-18173-8\_27},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MiyazakiMO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/NarayanaswamyR15,
author = {N. S. Narayanaswamy and
Swapnoneel Roy},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Block Sorting Is APX-Hard},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {377--389},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_28},
doi = {10.1007/978-3-319-18173-8\_28},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/NarayanaswamyR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/TamakoshiGIBT15,
author = {Yuya Tamakoshi and
Keisuke Goto and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {An Opportunistic Text Indexing Structure Based on Run Length Encoding},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {390--402},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_29},
doi = {10.1007/978-3-319-18173-8\_29},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/TamakoshiGIBT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Wehner15,
author = {David Wehner},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Advice Complexity of Fine-Grained Job Shop Scheduling},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {416--428},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_31},
doi = {10.1007/978-3-319-18173-8\_31},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Wehner15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ZandenB15,
author = {Tom C. van der Zanden and
Hans L. Bodlaender},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {PSPACE-Completeness of Bloxorz and of Games with 2-Buttons},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {403--415},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_30},
doi = {10.1007/978-3-319-18173-8\_30},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ZandenB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2015,
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8},
doi = {10.1007/978-3-319-18173-8},
isbn = {978-3-319-18172-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AlqahtaniE13,
author = {Hasna Mohsen Alqahtani and
Thomas Erlebach},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Approximation Algorithms for Disjoint \emph{st}-Paths with Minimum
Activation Cost},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {1--12},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_1},
doi = {10.1007/978-3-642-38233-8\_1},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AlqahtaniE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BackstromJOS13,
author = {Christer B{\"{a}}ckstr{\"{o}}m and
Peter Jonsson and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Parameterized Complexity and Kernel Bounds for Hard Planning Problems},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {13--24},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_2},
doi = {10.1007/978-3-642-38233-8\_2},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BackstromJOS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BampasPPS13,
author = {Evangelos Bampas and
Aris Pagourtzis and
George Pierrakos and
Vasilis Syrgkanis},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Selfish Resource Allocation in Optical Networks},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {25--36},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_3},
doi = {10.1007/978-3-642-38233-8\_3},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BampasPPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BelazzouguiR13,
author = {Djamal Belazzougui and
Mathieu Raffinot},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Average Optimal String Matching in Packed Strings},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {37--48},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_4},
doi = {10.1007/978-3-642-38233-8\_4},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BelazzouguiR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BevernBCHHNS13,
author = {Ren{\'{e}} van Bevern and
Robert Bredereck and
Morgan Chopin and
Sepp Hartung and
Falk H{\"{u}}ffner and
Andr{\'{e}} Nichterlein and
Ondrej Such{\'{y}}},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Parameterized Complexity of {DAG} Partitioning},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {49--60},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_5},
doi = {10.1007/978-3-642-38233-8\_5},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BevernBCHHNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BoyarFP13,
author = {Joan Boyar and
Magnus Find and
Ren{\'{e}} Peralta},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Four Measures of Nonlinearity},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {61--72},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_6},
doi = {10.1007/978-3-642-38233-8\_6},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BoyarFP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BruckdorferFK13,
author = {Till Bruckdorfer and
Stefan Felsner and
Michael Kaufmann},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {On the Characterization of Plane Bus Graphs},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {73--84},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_7},
doi = {10.1007/978-3-642-38233-8\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BruckdorferFK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BurceaWY13,
author = {Mihai Burcea and
Prudence W. H. Wong and
Fencol C. C. Yung},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {85--96},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_8},
doi = {10.1007/978-3-642-38233-8\_8},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BurceaWY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChrobakFHKLN13,
author = {Marek Chrobak and
Uriel Feige and
Mohammad Taghi Hajiaghayi and
Sanjeev Khanna and
Fei Li and
Seffi Naor},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {A Greedy Approximation Algorithm for Minimum-Gap Scheduling},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {97--109},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_9},
doi = {10.1007/978-3-642-38233-8\_9},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChrobakFHKLN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DantsinW13,
author = {Evgeny Dantsin and
Alexander Wolpert},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Exponential Complexity of Satisfiability Testing for Linear-Size Boolean
Formulas},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {110--121},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_10},
doi = {10.1007/978-3-642-38233-8\_10},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DantsinW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DattaLPP13,
author = {Ajoy Kumar Datta and
Lawrence L. Larmore and
Linda Pagli and
Giuseppe Prencipe},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Linear Time Distributed Swap Edge Algorithms},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {122--133},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_11},
doi = {10.1007/978-3-642-38233-8\_11},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DattaLPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Diaz-BanezKPPSS13,
author = {Jos{\'{e}} Miguel D{\'{\i}}az{-}B{\'{a}}{\~{n}}ez and
Matias Korman and
Pablo P{\'{e}}rez{-}Lantero and
Alexander Pilz and
Carlos Seara and
Rodrigo I. Silveira},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {New Results on Stabbing Segments with a Polygon},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {146--157},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_13},
doi = {10.1007/978-3-642-38233-8\_13},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Diaz-BanezKPPSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DisserFKM13,
author = {Yann Disser and
Andreas Emil Feldmann and
Max Klimm and
Mat{\'{u}}s Mihal{\'{a}}k},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Improving the \emph{H} \({}_{\mbox{ \emph{k} }}\)-Bound on the Price
of Stability in Undirected Shapley Network Design Games},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {158--169},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_14},
doi = {10.1007/978-3-642-38233-8\_14},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DisserFKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DobrevDHGKKNOSU13,
author = {Stefan Dobrev and
Stephane Durocher and
Mohsen Eftekhari Hesari and
Konstantinos Georgiou and
Evangelos Kranakis and
Danny Krizanc and
Lata Narayanan and
Jaroslav Opatrny and
Sunil M. Shende and
Jorge Urrutia},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Complexity of Barrier Coverage with Relocatable Sensors in the Plane},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {170--182},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_15},
doi = {10.1007/978-3-642-38233-8\_15},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/DobrevDHGKKNOSU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DolevFG13,
author = {Shlomi Dolev and
Nova Fandina and
Dan Gutfreund},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Succinct Permanent Is \emph{NEXP}-Hard with Many Hard Instances},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {183--196},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_16},
doi = {10.1007/978-3-642-38233-8\_16},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/DolevFG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EfraimidisK13,
author = {Pavlos S. Efraimidis and
Remous{-}Aris Koutsiamanis},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Money-Based Coordination of Network Packets},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {197--208},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_17},
doi = {10.1007/978-3-642-38233-8\_17},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EfraimidisK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EscoffierMPS13,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Fanny Pascual and
Olivier Spanjaard},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Truthful Many-to-Many Assignment with Private Weights},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {209--220},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_18},
doi = {10.1007/978-3-642-38233-8\_18},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EscoffierMPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FabijanNP13,
author = {Aleksander Fabijan and
Bengt J. Nilsson and
Mia Persson},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Competitive Online Clique Clustering},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {221--233},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_19},
doi = {10.1007/978-3-642-38233-8\_19},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FabijanNP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FlocchiniLPS13,
author = {Paola Flocchini and
Fabrizio Luccio and
Linda Pagli and
Nicola Santoro},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Optimal Network Decontamination with Threshold Immunity},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {234--245},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_20},
doi = {10.1007/978-3-642-38233-8\_20},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FlocchiniLPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GlantzM13,
author = {Roland Glantz and
Henning Meyerhenke},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Finding All Convex Cuts of a Plane Graph in Cubic Time},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {246--263},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_21},
doi = {10.1007/978-3-642-38233-8\_21},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GlantzM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GoldbergM13,
author = {Paul W. Goldberg and
Antony McCabe},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Shortest Paths with Bundles and Non-additive Weights Is Hard},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {264--275},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_22},
doi = {10.1007/978-3-642-38233-8\_22},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GoldbergM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GolovachHKR13,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Arash Rafiey},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Cliques and Clubs},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {276--287},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_23},
doi = {10.1007/978-3-642-38233-8\_23},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/GolovachHKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GolovachP13,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {List Coloring in the Absence of Two Subgraphs},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {288--299},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_24},
doi = {10.1007/978-3-642-38233-8\_24},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GolovachP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/JongUW13,
author = {Jasper de Jong and
Marc Uetz and
Andreas Wombacher},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Decentralized Throughput Scheduling},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {134--145},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_12},
doi = {10.1007/978-3-642-38233-8\_12},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/JongUW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KulkarniS13,
author = {Raghav Kulkarni and
Miklos Santha},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Query Complexity of Matroids},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {300--311},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_25},
doi = {10.1007/978-3-642-38233-8\_25},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KulkarniS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MaliMPZ13,
author = {Georgia Mali and
Panagiotis Michail and
Andreas Paraskevopoulos and
Christos D. Zaroliagis},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {A New Dynamic Graph Structure for Large-Scale Transportation Networks},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {312--323},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_26},
doi = {10.1007/978-3-642-38233-8\_26},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MaliMPZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Paluch13,
author = {Katarzyna E. Paluch},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Capacitated Rank-Maximal Matchings},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {324--335},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_27},
doi = {10.1007/978-3-642-38233-8\_27},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Paluch13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/PoonY13,
author = {Chung Keung Poon and
Hao Yuan},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {A Faster {CREW} {PRAM} Algorithm for Computing Cartesian Trees},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {336--344},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_28},
doi = {10.1007/978-3-642-38233-8\_28},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/PoonY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SeibertSU13,
author = {Sebastian Seibert and
Andreas Sprock and
Walter Unger},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Advice Complexity of the Online Coloring Problem},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {345--357},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_29},
doi = {10.1007/978-3-642-38233-8\_29},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SeibertSU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SumitaKM13,
author = {Hanna Sumita and
Naonori Kakimura and
Kazuhisa Makino},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Sparse Linear Complementarity Problems},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {358--369},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_30},
doi = {10.1007/978-3-642-38233-8\_30},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SumitaKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/YanC13,
author = {Li Yan and
Marek Chrobak},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {370--381},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_31},
doi = {10.1007/978-3-642-38233-8\_31},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/YanC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2013,
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8},
doi = {10.1007/978-3-642-38233-8},
isbn = {978-3-642-38232-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Abu-KhzamML10,
author = {Faisal N. Abu{-}Khzam and
Amer E. Mouawad and
Mathieu Liedloff},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {An Exact Algorithm for Connected Red-Blue Dominating Set},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {25--36},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_4},
doi = {10.1007/978-3-642-13073-1\_4},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Abu-KhzamML10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Baeza-Yates10,
author = {Ricardo Baeza{-}Yates},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Towards a Distributed Search Engine},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {1--5},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_1},
doi = {10.1007/978-3-642-13073-1\_1},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Baeza-Yates10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BauerCKKW10,
author = {Reinhard Bauer and
Tobias Columbus and
Bastian Katz and
Marcus Krug and
Dorothea Wagner},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Preprocessing Speed-Up Techniques Is Hard},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {359--370},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_32},
doi = {10.1007/978-3-642-13073-1\_32},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BauerCKKW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BaumeisterBFHR10,
author = {Dorothea Baumeister and
Felix Brandt and
Felix A. Fischer and
Jan Hoffmann and
J{\"{o}}rg Rothe},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {The Complexity of Computing Minimal Unidirectional Covering Sets},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {299--310},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_27},
doi = {10.1007/978-3-642-13073-1\_27},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BaumeisterBFHR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Binkele-RaibleBFKKLLR10,
author = {Daniel Binkele{-}Raible and
Ljiljana Brankovic and
Henning Fernau and
Joachim Kneis and
Dieter Kratsch and
Alexander Langer and
Mathieu Liedloff and
Peter Rossmanith},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {A Parameterized Route to Exact Puzzles: Breaking the 2\({}^{\mbox{\emph{n}}}\)-Barrier
for Irredundance},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {311--322},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_28},
doi = {10.1007/978-3-642-13073-1\_28},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Binkele-RaibleBFKKLLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BiroIM10,
author = {P{\'{e}}ter Bir{\'{o}} and
Robert W. Irving and
David F. Manlove},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Popular Matchings in the Marriage and Roommates Problems},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {97--108},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_10},
doi = {10.1007/978-3-642-13073-1\_10},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BiroIM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BockenhauerFHMSS10,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Karin Freiermuth and
Juraj Hromkovic and
Tobias M{\"{o}}mke and
Andreas Sprock and
Bj{\"{o}}rn Steffen},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {180--191},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_17},
doi = {10.1007/978-3-642-13073-1\_17},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BockenhauerFHMSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BockenhauerKMS10,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Ralf Klasing and
Tobias M{\"{o}}mke and
Monika Steinov{\'{a}}},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Improved Approximations for {TSP} with Simple Precedence Constraints},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {61--72},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_7},
doi = {10.1007/978-3-642-13073-1\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BockenhauerKMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BrennerS10,
author = {Janina A. Brenner and
Guido Sch{\"{a}}fer},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Online Cooperative Cost Sharing},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {252--263},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_23},
doi = {10.1007/978-3-642-13073-1\_23},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BrennerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaiY10,
author = {Leizhen Cai and
Boting Yang},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Parameterized Complexity of Even/Odd Subgraph Problems},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {85--96},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_9},
doi = {10.1007/978-3-642-13073-1\_9},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CaiY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChalopinDDMW10,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Shantanu Das and
Yann Disser and
Mat{\'{u}}s Mihal{\'{a}}k and
Peter Widmayer},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {How Simple Robots Benefit from Looking Back},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {229--239},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_21},
doi = {10.1007/978-3-642-13073-1\_21},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChalopinDDMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChalopinP10,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Dani{\"{e}}l Paulusma},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Packing Bipartite Graphs with Covers of Complete Bipartite Graphs},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {276--287},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_25},
doi = {10.1007/978-3-642-13073-1\_25},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChalopinP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChangL10,
author = {Ching{-}Lueh Chang and
Yuh{-}Dauh Lyuu},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Bounding the Number of Tolerable Faults in Majority-Based Systems},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {109--119},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_11},
doi = {10.1007/978-3-642-13073-1\_11},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChangL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CheilarisT10,
author = {Panagiotis Cheilaris and
G{\'{e}}za T{\'{o}}th},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Graph Unique-Maximum and Conflict-Free Colorings},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {143--154},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_14},
doi = {10.1007/978-3-642-13073-1\_14},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CheilarisT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChouL10,
author = {Jen{-}Hou Chou and
Chi{-}Jen Lu},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Communication Requirements for Stable Marriages},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {371--382},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_33},
doi = {10.1007/978-3-642-13073-1\_33},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChouL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CyganKL10,
author = {Marek Cygan and
Lukasz Kowalik and
Borut Luzar},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {A Planar Linear Arboricity Conjecture},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {204--216},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_19},
doi = {10.1007/978-3-642-13073-1\_19},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CyganKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CyganPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Irredundant Set Faster Than \emph{O}(2\({}^{\mbox{\emph{n}}}\))},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {288--298},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_26},
doi = {10.1007/978-3-642-13073-1\_26},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CyganPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DresslerS10,
author = {Daniel Dressler and
Martin Strehler},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Capacitated Confluent Flows: Complexity and Algorithms},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {347--358},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_31},
doi = {10.1007/978-3-642-13073-1\_31},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/DresslerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DuttingH10,
author = {Paul D{\"{u}}tting and
Monika Henzinger},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Mechanisms for the Marriage and the Assignment Game},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {6--12},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_2},
doi = {10.1007/978-3-642-13073-1\_2},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DuttingH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EscoffierGM10,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Strategic Coloring of a Graph},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {155--166},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_15},
doi = {10.1007/978-3-642-13073-1\_15},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EscoffierGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FranceschiniH10,
author = {Gianni Franceschini and
Torben Hagerup},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Finding the Maximum Suffix with Fewer Comparisons},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {323--334},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_29},
doi = {10.1007/978-3-642-13073-1\_29},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FranceschiniH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HeggernesMNV10,
author = {Pinar Heggernes and
Federico Mancini and
Jesper Nederlof and
Yngve Villanger},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {A Parameterized Algorithm for Chordal Sandwich},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {120--130},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_12},
doi = {10.1007/978-3-642-13073-1\_12},
timestamp = {Tue, 02 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/HeggernesMNV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Italiano10,
author = {Giuseppe F. Italiano},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Resilient Algorithms and Data Structures},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {13--24},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_3},
doi = {10.1007/978-3-642-13073-1\_3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Italiano10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Jansen10,
author = {Bart M. P. Jansen},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Kernelization for Maximum Leaf Spanning Tree with Positive Vertex
Weights},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {192--203},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_18},
doi = {10.1007/978-3-642-13073-1\_18},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Jansen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MitscheSS10,
author = {Dieter Mitsche and
Maria Saumell and
Rodrigo I. Silveira},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {On the Number of Higher Order Delaunay Triangulations},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {217--228},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_20},
doi = {10.1007/978-3-642-13073-1\_20},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/MitscheSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MonienT10,
author = {Burkhard Monien and
Tobias Tscheuschner},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {On the Power of Nodes of Degree Four in the Local Max-Cut Problem},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {264--275},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_24},
doi = {10.1007/978-3-642-13073-1\_24},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MonienT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Olsen10,
author = {Martin Olsen},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Maximizing PageRank with New Backlinks},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {37--48},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_5},
doi = {10.1007/978-3-642-13073-1\_5},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Olsen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/PichlerRW10,
author = {Reinhard Pichler and
Stefan R{\"{u}}mmele and
Stefan Woltran},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Multicut Algorithms via Tree Decompositions},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {167--179},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_16},
doi = {10.1007/978-3-642-13073-1\_16},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/PichlerRW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/RonT10,
author = {Dana Ron and
Gilad Tsur},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Testing Computability by Width-2 OBDDs Where the Variable Order is
Unknown},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {131--142},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_13},
doi = {10.1007/978-3-642-13073-1\_13},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/RonT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Rooij10,
author = {Johan M. M. van Rooij},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Polynomial Space Algorithms for Counting Dominating Sets and the Domatic
Number},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {73--84},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_8},
doi = {10.1007/978-3-642-13073-1\_8},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Rooij10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/TripathiVK10,
author = {Rahul Tripathi and
Elena Valkanova and
V. S. Anil Kumar},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {On Strategy Improvement Algorithms for Simple Stochastic Games},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {240--251},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_22},
doi = {10.1007/978-3-642-13073-1\_22},
timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/TripathiVK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ZhangGI10,
author = {Hui Zhang and
Qing Guo and
Costas S. Iliopoulos},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {An Algorithmic Framework for Motif Discovery Problems in Weighted
Sequences},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {335--346},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_30},
doi = {10.1007/978-3-642-13073-1\_30},
timestamp = {Thu, 30 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ZhangGI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ZhuangN10,
author = {Bingbing Zhuang and
Hiroshi Nagamochi},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Enumerating Rooted Graphs with Reflectional Block Structures},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {49--60},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_6},
doi = {10.1007/978-3-642-13073-1\_6},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ZhuangN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2010,
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1},
doi = {10.1007/978-3-642-13073-1},
isbn = {978-3-642-13072-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AsahiroFIM06,
author = {Yuichi Asahiro and
Tetsuya Furukawa and
Keiichi Ikegami and
Eiji Miyano},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {How to Pack Directed Acyclic Graphs into Small Blocks},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {272--283},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_27},
doi = {10.1007/11758471\_27},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AsahiroFIM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BermondCY06,
author = {Jean{-}Claude Bermond and
Ricardo C. Corr{\^{e}}a and
Min{-}Li Yu},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Gathering Algorithms on Paths Under Interference Constraints},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {115--126},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_14},
doi = {10.1007/11758471\_14},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BermondCY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BilleG06,
author = {Philip Bille and
Inge Li G{\o}rtz},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Matching Subsequences in Trees},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {248--259},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_25},
doi = {10.1007/11758471\_25},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BilleG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BleischwitzM06,
author = {Yvonne Bleischwitz and
Burkhard Monien},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {175--186},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_19},
doi = {10.1007/11758471\_19},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BleischwitzM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BlunckV06,
author = {Henrik Blunck and
Jan Vahrenhold},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {In-Place Randomized Slope Selection},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {30--41},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_6},
doi = {10.1007/11758471\_6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BlunckV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BroersmaCP06,
author = {Hajo Broersma and
Agostino Capponi and
Dani{\"{e}}l Paulusma},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {On-Line Coloring of H-Free Bipartite Graphs},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {284--295},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_28},
doi = {10.1007/11758471\_28},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BroersmaCP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChenLLJ06,
author = {Xin Chen and
Lan Liu and
Zheng Liu and
Tao Jiang},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {On the Minimum Common Integer Partition Problem},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {236--247},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_24},
doi = {10.1007/11758471\_24},
timestamp = {Wed, 22 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/ChenLLJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChlebikC06,
author = {Miroslav Chleb{\'{\i}}k and
Janka Chleb{\'{\i}}kov{\'{a}}},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Inapproximability Results for Orthogonal Rectangle Packing Problems
with Rotations},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {199--210},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_21},
doi = {10.1007/11758471\_21},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChlebikC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CzygrinowHS06,
author = {Andrzej Czygrinow and
Michal Hanckowiak and
Edyta Szymanska},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Distributed Approximation Algorithms for Planar Graphs},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {296--307},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_29},
doi = {10.1007/11758471\_29},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CzygrinowHS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Damaschke06,
author = {Peter Damaschke},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Fixed-Parameter Tractable Generalizations of Cluster Editing},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {344--355},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_33},
doi = {10.1007/11758471\_33},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Damaschke06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DantsinHW06,
author = {Evgeny Dantsin and
Edward A. Hirsch and
Alexander Wolpert},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Clause Shortening Combined with Pruning Yields a New Upper Bound for
Deterministic {SAT} Algorithms},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {60--68},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_9},
doi = {10.1007/11758471\_9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DantsinHW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DobrevKSS06,
author = {Stefan Dobrev and
Rastislav Kralovic and
Nicola Santoro and
Wei Shi},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Black Hole Search in Asynchronous Rings Using Tokens},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {139--150},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_16},
doi = {10.1007/11758471\_16},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DobrevKSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DomGHNT06,
author = {Michael Dom and
Jiong Guo and
Falk H{\"{u}}ffner and
Rolf Niedermeier and
Anke Tru{\ss}},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Fixed-Parameter Tractability Results for Feedback Set Problems in
Tournaments},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {320--331},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_31},
doi = {10.1007/11758471\_31},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DomGHNT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DraganY06,
author = {Feodor F. Dragan and
Chenyu Yan},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Distance Approximating Trees: Complexity and Algorithms},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {260--271},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_26},
doi = {10.1007/11758471\_26},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DraganY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EisenbrandH06,
author = {Friedrich Eisenbrand and
Edda Happ},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Provisioning a Virtual Private Network Under the Presence of Non-communicating
Groups},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {105--114},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_13},
doi = {10.1007/11758471\_13},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EisenbrandH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ErlebachHHM06,
author = {Thomas Erlebach and
Alexander Hall and
Michael Hoffmann and
Mat{\'{u}}s Mihal{\'{a}}k},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Network Discovery and Verification with Distance Queries},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {69--80},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_10},
doi = {10.1007/11758471\_10},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ErlebachHHM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EvenRS06,
author = {Guy Even and
Dror Rawitz and
Shimon Shahar},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Approximation Algorithms for Capacitated Rectangle Stabbing},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {18--29},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_5},
doi = {10.1007/11758471\_5},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EvenRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Fernau06,
author = {Henning Fernau},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Parameterized Algorithms for Hitting Set: The Weighted Case},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {332--343},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_32},
doi = {10.1007/11758471\_32},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Fernau06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FournierM06,
author = {Herv{\'{e}} Fournier and
Guillaume Malod},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Universal Relations and {\#}P-Completeness},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {368--379},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_35},
doi = {10.1007/11758471\_35},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FournierM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FriedlISV06,
author = {Katalin Friedl and
G{\'{a}}bor Ivanyos and
Miklos Santha and
Yves F. Verhoeven},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Locally 2-Dimensional Sperner Problems Complete for the Polynomial
Parity Argument Classes},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {380--391},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_36},
doi = {10.1007/11758471\_36},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FriedlISV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Fuchs06,
author = {Bernhard Fuchs},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {On the Hardness of Range Assignment Problems},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {127--138},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_15},
doi = {10.1007/11758471\_15},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Fuchs06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GrantsonL06,
author = {Magdalene Grantson and
Christos Levcopoulos},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Covering a Set of Points with a Minimum Number of Lines},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {6--17},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_4},
doi = {10.1007/11758471\_4},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GrantsonL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Gunia06,
author = {Christian Gunia},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {On Broadcast Scheduling with Limited Energy},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {151--162},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_17},
doi = {10.1007/11758471\_17},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Gunia06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GutinRSY06,
author = {Gregory Z. Gutin and
Arash Rafiey and
Stefan Szeider and
Anders Yeo},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {The Linear Arrangement Problem Parameterized Above Guaranteed Value},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {356--367},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_34},
doi = {10.1007/11758471\_34},
timestamp = {Thu, 22 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/GutinRSY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KantorP06,
author = {Erez Kantor and
David Peleg},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Approximate Hierarchical Facility Location and Applications to the
Shallow Steiner Tree and Range Assignment Problems},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {211--222},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_22},
doi = {10.1007/11758471\_22},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KantorP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KaoS06,
author = {Ming{-}Yang Kao and
Manan Sanghi},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {An Approximation Algorithm for a Bottleneck Traveling Salesman Problem},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {223--235},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_23},
doi = {10.1007/11758471\_23},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KaoS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KernW06,
author = {Walter Kern and
Gerhard J. Woeginger},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Quadratic Programming and Combinatorial Minimum Weight Product Problems},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {42--49},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_7},
doi = {10.1007/11758471\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KernW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KoukopoulosN06,
author = {Dimitrios Koukopoulos and
Stavros D. Nikolopoulos},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection
Rates},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {93--104},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_12},
doi = {10.1007/11758471\_12},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KoukopoulosN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Kovacs06,
author = {Annam{\'{a}}ria Kov{\'{a}}cs},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Tighter Approximation Bounds for {LPT} Scheduling in Two Special Cases},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {187--198},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_20},
doi = {10.1007/11758471\_20},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Kovacs06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Kulkarni06,
author = {Raghav Kulkarni},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {A New NC-Algorithm for Finding a Perfect Matching in \emph{d}-Regular
Bipartite Graphs When \emph{d} Is Small},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {308--319},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_30},
doi = {10.1007/11758471\_30},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Kulkarni06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Mehlhorn06,
author = {Kurt Mehlhorn},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Reliable and Efficient Geometric Computing},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {1--2},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_1},
doi = {10.1007/11758471\_1},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Mehlhorn06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Porschen06,
author = {Stefan Porschen},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Counting All Solutions of Minimum Weight Exact Satisfiability},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {50--59},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_8},
doi = {10.1007/11758471\_8},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Porschen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Preparata06,
author = {Franco P. Preparata},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Beware of the Model: Reflections on Algorithmic Research},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {3--4},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_2},
doi = {10.1007/11758471\_2},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Preparata06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Pudlak06,
author = {Pavel Pudl{\'{a}}k},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {On Search Problems in Complexity Theory and in Logic (Abstract)},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {5},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_3},
doi = {10.1007/11758471\_3},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Pudlak06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Ting06,
author = {Hing{-}Fung Ting},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {A Near Optimal Scheduler for On-Demand Data Broadcasts},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {163--174},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_18},
doi = {10.1007/11758471\_18},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Ting06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Weinard06,
author = {Maik Weinard},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Deciding the {FIFO} Stability of Networks in Polynomial Time},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {81--92},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_11},
doi = {10.1007/11758471\_11},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Weinard06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2006,
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471},
doi = {10.1007/11758471},
isbn = {3-540-34375-X},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AertsKS03,
author = {Joep Aerts and
Jan H. M. Korst and
Frits C. R. Spieksma},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Approximation of a Retrieval Problem for Parallel Disks},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {178--188},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_23},
doi = {10.1007/3-540-44849-7\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AertsKS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AmanoM03,
author = {Kazuyuki Amano and
Akira Maruoka},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Some Properties of MOD\({}_{\mbox{m}}\) Circuits Computing Simple
Functions},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {227--237},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_27},
doi = {10.1007/3-540-44849-7\_27},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AmanoM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BaltzS03,
author = {Andreas Baltz and
Anand Srivastav},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Fast Approximation of Minimum Multicast Congestion - Implementation
versus Theory},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {165--177},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_22},
doi = {10.1007/3-540-44849-7\_22},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BaltzS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BazganHM03,
author = {Cristina Bazgan and
Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Differential Approximation for Some Routing Problems},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {277--288},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_31},
doi = {10.1007/3-540-44849-7\_31},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BazganHM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BishnuDNB03,
author = {Arijit Bishnu and
Sandip Das and
Subhas C. Nandy and
Bhargab B. Bhattacharya},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {An Improved Algorithm for Point Set Pattern Matching under Rigid Motion},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {36--45},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_11},
doi = {10.1007/3-540-44849-7\_11},
timestamp = {Sun, 24 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BishnuDNB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BockenhauerBHKPSU03,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Dirk Bongartz and
Juraj Hromkovic and
Ralf Klasing and
Guido Proietti and
Sebastian Seibert and
Walter Unger},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {On k-Edge-Connectivity Problems with Sharpened Triangle Inequality},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {189--200},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_24},
doi = {10.1007/3-540-44849-7\_24},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BockenhauerBHKPSU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BongiovanniP03,
author = {Gian Carlo Bongiovanni and
Paolo Penna},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {XOR-Based Schemes for Fast Parallel {IP} Lookups},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {238--250},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_28},
doi = {10.1007/3-540-44849-7\_28},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BongiovanniP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BonizzoniVD03,
author = {Paola Bonizzoni and
Gianluca Della Vedova and
Riccardo Dondi},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Reconciling Gene Trees to a Species Tree},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {120--131},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_18},
doi = {10.1007/3-540-44849-7\_18},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BonizzoniVD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BoyarF03,
author = {Joan Boyar and
Lene M. Favrholdt},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {The Relative Worst Order Ratio for On-Line Algorithms},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {58--69},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_13},
doi = {10.1007/3-540-44849-7\_13},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BoyarF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BruceHKR03,
author = {Richard Bruce and
Michael Hoffmann and
Danny Krizanc and
Rajeev Raman},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Efficient Update Strategies for Geometric Computing with Uncertainty},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {12--23},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_9},
doi = {10.1007/3-540-44849-7\_9},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BruceHKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChanLTW03,
author = {Wun{-}Tat Chan and
Tak Wah Lam and
Hing{-}Fung Ting and
Prudence W. H. Wong},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {On-Line Stream Merging, Max Span, and Min Coverage},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {70--82},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_14},
doi = {10.1007/3-540-44849-7\_14},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChanLTW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChepoiDY03,
author = {Victor Chepoi and
Feodor F. Dragan and
Chenyu Yan},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Additive Spanners for k-Chordal Graphs},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {96--107},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_16},
doi = {10.1007/3-540-44849-7\_16},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChepoiDY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChlebikC03,
author = {Miroslav Chleb{\'{\i}}k and
Janka Chleb{\'{\i}}kov{\'{a}}},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Approximation Hardness for Small Occurrence Instances of NP-Hard Problems},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {152--164},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_21},
doi = {10.1007/3-540-44849-7\_21},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChlebikC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DuckworthM03,
author = {William Duckworth and
Bernard Mans},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Randomised Algorithms for Finding Small Weakly-Connected Dominating
Sets of Regular Graphs},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {83--95},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_15},
doi = {10.1007/3-540-44849-7\_15},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DuckworthM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GabrieleMRS03,
author = {Alessandra Gabriele and
Filippo Mignosi and
Antonio Restivo and
Marinella Sciortino},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Indexing Structures for Approximate String Matching},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {140--151},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_20},
doi = {10.1007/3-540-44849-7\_20},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GabrieleMRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GrammGHN03,
author = {Jens Gramm and
Jiong Guo and
Falk H{\"{u}}ffner and
Rolf Niedermeier},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique
Generation},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {108--119},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_17},
doi = {10.1007/3-540-44849-7\_17},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GrammGHN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HolzapfelKMT03,
author = {Klaus Holzapfel and
Sven Kosub and
Moritz G. Maa{\ss} and
Hanjo T{\"{a}}ubig},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {The Complexity of Detecting Fixed-Density Clusters},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {201--212},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_25},
doi = {10.1007/3-540-44849-7\_25},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HolzapfelKMT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KalyanasundaramVW03,
author = {Bala Kalyanasundaram and
Mahendran Velauthapillai and
John G. Waclawsky},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Unlocking the Advantages of Dynamic Service Selection and Pricing},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {46--57},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_12},
doi = {10.1007/3-540-44849-7\_12},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KalyanasundaramVW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KoukopoulosMNS03,
author = {Dimitrios Koukopoulos and
Marios Mavronicolas and
Sotiris E. Nikoletseas and
Paul G. Spirakis},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {The Impact of Network Structure on the Stability of Greedy Protocols},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {251--263},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_29},
doi = {10.1007/3-540-44849-7\_29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KoukopoulosMNS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KranakisPSTW03,
author = {Evangelos Kranakis and
Paolo Penna and
Konrad Schlude and
David Scot Taylor and
Peter Widmayer},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Improving Customer Proximity to Railway Stations},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {264--276},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_30},
doi = {10.1007/3-540-44849-7\_30},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KranakisPSTW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Leiserson03,
author = {Charles E. Leiserson},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Cache-Oblivious Algorithms},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {5},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_5},
doi = {10.1007/3-540-44849-7\_5},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Leiserson03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MarkouZF03,
author = {Euripides Markou and
Stathis Zachos and
Christodoulos Fragoudakis},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {24--35},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_10},
doi = {10.1007/3-540-44849-7\_10},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MarkouZF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Peleg03,
author = {David Peleg},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Localized Network Representations},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {1},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_1},
doi = {10.1007/3-540-44849-7\_1},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Peleg03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Peleg03a,
author = {David Peleg},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Spanning Trees with Low Maximum/Average Stretch},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {6},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_6},
doi = {10.1007/3-540-44849-7\_6},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Peleg03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Rabin03,
author = {Michael O. Rabin},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Hyper Encryption and Everlasting Secrets},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {7--10},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_7},
doi = {10.1007/3-540-44849-7\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Rabin03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Savage03,
author = {John E. Savage},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Computing with Electronic Nanotechnologies},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {11},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_8},
doi = {10.1007/3-540-44849-7\_8},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Savage03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Szwarcfiter03,
author = {Jayme Luiz Szwarcfiter},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Optimal Binary Search Trees with Costs Depending on the Access Paths},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {2},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_2},
doi = {10.1007/3-540-44849-7\_2},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Szwarcfiter03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Szwarcfiter03a,
author = {Jayme Luiz Szwarcfiter},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {On the Generation of Extensions of a Partially Ordered Set},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {3},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_3},
doi = {10.1007/3-540-44849-7\_3},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Szwarcfiter03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Szwarcfiter03b,
author = {Jayme Luiz Szwarcfiter},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Generating All Forest Extensions of a Partially Ordered Set},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {132--139},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_19},
doi = {10.1007/3-540-44849-7\_19},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Szwarcfiter03b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Trevisan03,
author = {Luca Trevisan},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Error-Correcting Codes in Complexity Theory},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {4},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_4},
doi = {10.1007/3-540-44849-7\_4},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Trevisan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Yamakami03,
author = {Tomoyuki Yamakami},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Nearly Bounded Error Probabilistic Sets},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {213--226},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_26},
doi = {10.1007/3-540-44849-7\_26},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Yamakami03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2003,
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7},
doi = {10.1007/3-540-44849-7},
isbn = {3-540-40176-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AusielloLM00,
author = {Giorgio Ausiello and
Stefano Leonardi and
Alberto Marchetti{-}Spaccamela},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {On Salesmen, Repairmen, Spiders, and Other Traveling Agents},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {1--16},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_1},
doi = {10.1007/3-540-46521-9\_1},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/AusielloLM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BarcucciBLN00,
author = {Elena Barcucci and
Sara Brunetti and
Alberto Del Lungo and
Maurice Nivat},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Reconstruction of Discrete Sets from Three or More X-Rays},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {199--210},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_17},
doi = {10.1007/3-540-46521-9\_17},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BarcucciBLN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BattiatoCCCH00,
author = {Sebastiano Battiato and
Domenico Cantone and
Dario Catalano and
Gianluca Cincotti and
Micha Hofri},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {An Efficient Algorithm for the Approximate Median Selection Problem},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {226--238},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_19},
doi = {10.1007/3-540-46521-9\_19},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BattiatoCCCH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BlomKPS00,
author = {Michiel Blom and
Sven Oliver Krumke and
Willem de Paepe and
Leen Stougie},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {The Online-TSP against Fair Adversaries},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {137--149},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_12},
doi = {10.1007/3-540-46521-9\_12},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BlomKPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BockenhauerHKSU00,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Juraj Hromkovic and
Ralf Klasing and
Sebastian Seibert and
Walter Unger},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Towards the Notion of Stability of Approximation for Hard Optimization
Tasks and the Traveling Salesman Problem},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {72--86},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_7},
doi = {10.1007/3-540-46521-9\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BockenhauerHKSU00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BrimkovCCL00,
author = {Valentin E. Brimkov and
Bruno Codenotti and
Valentino Crespi and
Mauro Leoncini},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {On the Lov{\'{a}}sz Number of Certain Circulant Graphs},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {291--305},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_24},
doi = {10.1007/3-540-46521-9\_24},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BrimkovCCL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CantoneC00,
author = {Domenico Cantone and
Gianluca Cincotti},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {150--162},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_13},
doi = {10.1007/3-540-46521-9\_13},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CantoneC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CovinoPC00,
author = {Emanuele Covino and
Giovanni Pani and
Salvatore Caporaso},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Extending the Implicit Computational Complexity Approach to the Sub-elementary
Time-Space Classes},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {239--252},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_20},
doi = {10.1007/3-540-46521-9\_20},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CovinoPC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Damaschke00,
author = {Peter Damaschke},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Online Strategies for Backups},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {63--71},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_6},
doi = {10.1007/3-540-46521-9\_6},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Damaschke00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DeoA00,
author = {Narsingh Deo and
Ayman M. Abdalla},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Computing a Diameter-Constrained Minimum Spanning Tree in Parallel},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {17--31},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_2},
doi = {10.1007/3-540-46521-9\_2},
timestamp = {Wed, 20 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/DeoA00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Dinur00,
author = {Irit Dinur},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Approximating SVP\({}_{\mbox{infty}}\) to within Almost-Polynomial
Factors Is NP-Hard},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {263--276},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_22},
doi = {10.1007/3-540-46521-9\_22},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Dinur00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GrammN00,
author = {Jens Gramm and
Rolf Niedermeier},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Faster Exact Solutions for {MAX2SAT}},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {174--186},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_15},
doi = {10.1007/3-540-46521-9\_15},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GrammN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HankeS00,
author = {Sabine Hanke and
Eljas Soisalon{-}Soininen},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Group Updates for Red-Black Trees},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {253--262},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_21},
doi = {10.1007/3-540-46521-9\_21},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HankeS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HauptmeierKR00,
author = {Dietrich Hauptmeier and
Sven Oliver Krumke and
J{\"{o}}rg Rambau},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {The Online Dial-a-Ride Problem under Reasonable Load},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {125--136},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_11},
doi = {10.1007/3-540-46521-9\_11},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HauptmeierKR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MerliniSV00,
author = {Donatella Merlini and
Renzo Sprugnoli and
M. Cecilia Verri},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Modified Binary Searching for Static Tables},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {211--225},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_18},
doi = {10.1007/3-540-46521-9\_18},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MerliniSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/NandyHA00,
author = {Subhas C. Nandy and
Tomohiro Harayama and
Tetsuo Asano},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Dynamically Maintaining the Widest k -Dense Corridor},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {187--198},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_16},
doi = {10.1007/3-540-46521-9\_16},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/NandyHA00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/NeyerW00,
author = {Gabriele Neyer and
Frank Wagner},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Labeling Downtown},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {113--124},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_10},
doi = {10.1007/3-540-46521-9\_10},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/NeyerW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/NoilhanS00,
author = {Fabrice Noilhan and
Miklos Santha},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Semantical Counting Circuits},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {87--101},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_8},
doi = {10.1007/3-540-46521-9\_8},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/NoilhanS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/RedstoneR00,
author = {Joshua Redstone and
Walter L. Ruzzo},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Algorithms for a Simple Point Placement Problem},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {32--43},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_3},
doi = {10.1007/3-540-46521-9\_3},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/RedstoneR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SeibertU00,
author = {Sebastian Seibert and
Walter Unger},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {The Hardness of Placing Street Names in a Manhattan Type Map},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {102--112},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_9},
doi = {10.1007/3-540-46521-9\_9},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SeibertU00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ShibataKFTSSA00,
author = {Yusuke Shibata and
Takuya Kida and
Shuichi Fukamachi and
Masayuki Takeda and
Ayumi Shinohara and
Takeshi Shinohara and
Setsuo Arikawa},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Speeding Up Pattern Matching by Text Compression},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {306--315},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_25},
doi = {10.1007/3-540-46521-9\_25},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ShibataKFTSSA00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SteinhofelAW00,
author = {Kathleen Steinh{\"{o}}fel and
Andreas Alexander Albrecht and
Chak{-}Kuen Wong},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Convergence Analysis of Simulated Annealing-Based Algorithms Solving
Flow Shop Scheduling Problems},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {277--290},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_23},
doi = {10.1007/3-540-46521-9\_23},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SteinhofelAW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Vega00,
author = {Wenceslas Fernandez de la Vega},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {The Independence Number of Random Interval Graphs},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {59--62},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_5},
doi = {10.1007/3-540-46521-9\_5},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Vega00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/WangCY00,
author = {Cao An Wang and
Francis Y. L. Chin and
Bo{-}Ting Yang},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Triangulations without Minimum-Weight Drawing},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {163--173},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_14},
doi = {10.1007/3-540-46521-9\_14},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/WangCY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Zaks00,
author = {Shmuel Zaks},
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Duality in {ATM} Layout Problems},
booktitle = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
pages = {44--58},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9\_4},
doi = {10.1007/3-540-46521-9\_4},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Zaks00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2000,
editor = {Gian Carlo Bongiovanni and
Giorgio Gambosi and
Rossella Petreschi},
title = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
Italy, March 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1767},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46521-9},
doi = {10.1007/3-540-46521-9},
isbn = {3-540-67159-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2000.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AlimontiK97,
author = {Paola Alimonti and
Viggo Kann},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Hardness of Approximating Problems on Cubic Graphs},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {288--298},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_80},
doi = {10.1007/3-540-62592-5\_80},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AlimontiK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AmirD97,
author = {Amihood Amir and
Emanuel Dar},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {An Improved Deterministic Algorithms for Generalized Random Sampling},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {159--170},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_69},
doi = {10.1007/3-540-62592-5\_69},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AmirD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Bernasconi97,
author = {Anna Bernasconi},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {On the Complexity of Balanced Boolean Functions},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {253--263},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_77},
doi = {10.1007/3-540-62592-5\_77},
timestamp = {Sat, 23 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Bernasconi97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Bilardi97,
author = {Gianfranco Bilardi},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Algorithms and Data Structures for Control Dependence and Related
Compiler Problems},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {1--2},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_55},
doi = {10.1007/3-540-62592-5\_55},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Bilardi97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaporasoZGC97,
author = {Salvatore Caporaso and
Michele Zito and
Nicola Galesi and
Emanuele Covino},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Syntactic Characterization in {LISP} of the Polynominal Complexity
Classes and Hierarchy},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {61--73},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_61},
doi = {10.1007/3-540-62592-5\_61},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CaporasoZGC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CattaneoFM97,
author = {Gianpiero Cattaneo and
Michele Finelli and
Luciano Margara},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Topological Chaos for Elementary Cellular Automata},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {241--252},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_76},
doi = {10.1007/3-540-62592-5\_76},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/CattaneoFM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Damaschke97,
author = {Peter Damaschke},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {The Algorithmic Complexity of Chemical Threshold Testing},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {205--216},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_73},
doi = {10.1007/3-540-62592-5\_73},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Damaschke97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DattaKO97,
author = {Amitava Datta and
Kamala Krithivasan and
Thomas Ottmann},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {110--121},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_65},
doi = {10.1007/3-540-62592-5\_65},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DattaKO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DinitzN97,
author = {Yefim Dinitz and
Zeev Nutov},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Finding Optimum \emph{k}-vertex Connected Spanning Subgraphs: Improved
Approximation Algorithms for \emph{k}=3, 4, 5},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {13--24},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_57},
doi = {10.1007/3-540-62592-5\_57},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DinitzN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Domingo97,
author = {Carlos Domingo},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Polynominal Time Algorithms for Some Self-Duality Problems},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {171--180},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_70},
doi = {10.1007/3-540-62592-5\_70},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Domingo97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EvenE97,
author = {Guy Even and
Shimon Even},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Embedding Interconnection Networks in Grids via the Layered Cross
Product},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {3--12},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_56},
doi = {10.1007/3-540-62592-5\_56},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EvenE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FeigeR97,
author = {Uriel Feige and
Giora Rayzman},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {On the Drift of Short Schedules},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {74--85},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_62},
doi = {10.1007/3-540-62592-5\_62},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FeigeR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FerraginaGM97,
author = {Paolo Ferragina and
Roberto Grossi and
Manuela Montangero},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {A Note on Updating Suffix Tree Labels},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {181--192},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_71},
doi = {10.1007/3-540-62592-5\_71},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FerraginaGM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FossmeierK97,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Nice Drawings for Planar Bipartite Graphs},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {122--134},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_66},
doi = {10.1007/3-540-62592-5\_66},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FossmeierK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GomezRT97,
author = {Francisco G{\'{o}}mez and
Suneeta Ramaswami and
Godfried T. Toussaint},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {On Removing Non-degeneracy Assumptions in Computational Geometry},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {86--99},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_63},
doi = {10.1007/3-540-62592-5\_63},
timestamp = {Thu, 29 Mar 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GomezRT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HankeOS97,
author = {Sabine Hanke and
Thomas Ottmann and
Eljas Soisalon{-}Soininen},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Relaxed Balanced Red-Black Trees},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {193--204},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_72},
doi = {10.1007/3-540-62592-5\_72},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HankeOS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {R\({}^{\mbox{SN}}\)\({}_{\mbox{1-tt}}\)(NP) Distinguishes Robust Many-One
and Turing Completeness},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {49--60},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_60},
doi = {10.1007/3-540-62592-5\_60},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HemaspaandraRW97,
author = {Lane A. Hemaspaandra and
J{\"{o}}rg Rothe and
Gerd Wechsung},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {On Sets with Easy Certificates and the Existence of One-Way Permutations},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {264--275},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_78},
doi = {10.1007/3-540-62592-5\_78},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HemaspaandraRW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Jansen97,
author = {Klaus Jansen},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {The Optimum Cost Chromatic Partition Problem},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {25--36},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_58},
doi = {10.1007/3-540-62592-5\_58},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Jansen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Kao97,
author = {Ming{-}Yang Kao},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Tree Contractions and Evolutionary Trees},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {299--310},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_81},
doi = {10.1007/3-540-62592-5\_81},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Kao97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KatajainenT97,
author = {Jyrki Katajainen and
Jesper Larsson Tr{\"{a}}ff},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {A Meticulous Analysis of Mergesort Programs},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {217--228},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_74},
doi = {10.1007/3-540-62592-5\_74},
timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KatajainenT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KhullerPS97,
author = {Samir Khuller and
Robert Pless and
Yoram J. Sussmann},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Fault Tolerant K-Center Problems},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {37--48},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_59},
doi = {10.1007/3-540-62592-5\_59},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KhullerPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/LiottaTTV97,
author = {Giuseppe Liotta and
Roberto Tamassia and
Ioannis G. Tollis and
Paola Vocca},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Area Requirement of Gabriel Drawings},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {135--146},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_67},
doi = {10.1007/3-540-62592-5\_67},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/LiottaTTV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/LuccioP97,
author = {Fabrizio Luccio and
Alberto Pedrotti},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Design of Reliable Combinatorial Algorithms Using Certificates},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {147--158},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_68},
doi = {10.1007/3-540-62592-5\_68},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/LuccioP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SibeynK97,
author = {Jop F. Sibeyn and
Michael Kaufmann},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {BSP-Like External-Memory Computation},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {229--240},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_75},
doi = {10.1007/3-540-62592-5\_75},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SibeynK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/YamazakiBFT97,
author = {Koichi Yamazaki and
Hans L. Bodlaender and
Babette de Fluiter and
Dimitrios M. Thilikos},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Isomorphism for Graphs of Bounded Distance Width},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {276--287},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_79},
doi = {10.1007/3-540-62592-5\_79},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/YamazakiBFT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/dAmoreFGT97,
author = {Fabrizio d'Amore and
Paolo Giulio Franciosa and
Roberto Giaccio and
Maurizio Talamo},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Maintaining Maxima under Boundary Updates},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {100--109},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_64},
doi = {10.1007/3-540-62592-5\_64},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/dAmoreFGT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/1997,
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5},
doi = {10.1007/3-540-62592-5},
isbn = {3-540-62592-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/1997.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Alimonti94,
author = {Paola Alimonti},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {New Local Search Approximation Techniques for Maximum Generalized
Satisfiability Problems},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {40--53},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_5},
doi = {10.1007/3-540-57811-0\_5},
timestamp = {Fri, 17 Jul 2020 16:12:46 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Alimonti94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BergadanoV94,
author = {Francesco Bergadano and
Stefano Varricchio},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Learning Behaviors of Automata from Multiplicity and Equivalence Queries},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {54--62},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_6},
doi = {10.1007/3-540-57811-0\_6},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BergadanoV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BernasconiC94,
author = {Anna Bernasconi and
Bruno Codenotti},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Measures of Boolean Function Complexity Based on Harmonic Analysis},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {63--72},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_7},
doi = {10.1007/3-540-57811-0\_7},
timestamp = {Sat, 23 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BernasconiC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ClementiI94,
author = {Andrea Clementi and
Russell Impagliazzo},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Graph Theory and Interactive Protocols for Reachability Problems on
Finite Cellular Automata},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {73--90},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_8},
doi = {10.1007/3-540-57811-0\_8},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ClementiI94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Crescenzo94,
author = {Giovanni Di Crescenzo},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {A Non-Iterative Electronic Cash System},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {109--124},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_10},
doi = {10.1007/3-540-57811-0\_10},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Crescenzo94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DekelH94,
author = {Eliezer Dekel and
Jie Hu},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Parallel Pruning Decomposition {(PDS)} and Biconnected Components
of Graphs},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {91--108},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_9},
doi = {10.1007/3-540-57811-0\_9},
timestamp = {Thu, 09 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DekelH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EvenL94,
author = {Shimon Even and
Ami Litman},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {A Unified Scheme for Routing in Expander Based Networks},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {125--135},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_11},
doi = {10.1007/3-540-57811-0\_11},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EvenL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FrigioniMN94,
author = {Daniele Frigioni and
Alberto Marchetti{-}Spaccamela and
Umberto Nanni},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Dynamization of Backtrack-Free Search for the Constraint Satisfaction
Problem},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {136--151},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_12},
doi = {10.1007/3-540-57811-0\_12},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FrigioniMN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GargT94,
author = {Ashim Garg and
Roberto Tamassia},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Advances in Graph Drawing},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {12--21},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_2},
doi = {10.1007/3-540-57811-0\_2},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GargT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HartmanisC94,
author = {Juris Hartmanis and
Suresh Chari},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {On the Intellectual Terrain Around {NP}},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {1--11},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_1},
doi = {10.1007/3-540-57811-0\_1},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HartmanisC94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HofriS94,
author = {Micha Hofri and
Hadas Shachnai},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Efficient Reorganization of Binary Search Trees},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {152--166},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_13},
doi = {10.1007/3-540-57811-0\_13},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HofriS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/IsraeliKKS94,
author = {Amos Israeli and
Evangelos Kranakis and
Danny Krizanc and
Nicola Santoro},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Time-Message Trade-Offs for the Weak Unison Problem},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {167--178},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_14},
doi = {10.1007/3-540-57811-0\_14},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/IsraeliKKS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/LamL94,
author = {Tak Wah Lam and
Ka Hing Lee},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {On Set Equality-Testing},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {179--191},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_15},
doi = {10.1007/3-540-57811-0\_15},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/LamL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MontiR94,
author = {Angelo Monti and
Alessandro Roncato},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {On the Complexity of Some Reachability Problems},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {192--202},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_16},
doi = {10.1007/3-540-57811-0\_16},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MontiR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Mundhenk94,
author = {Martin Mundhenk},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {On Self-Reducible Sets of Low Information Content},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {203--212},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_17},
doi = {10.1007/3-540-57811-0\_17},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Mundhenk94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Rub94,
author = {Christine R{\"{u}}b},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Lower Bounds for Merging on the Hypercube},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {213--222},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_18},
doi = {10.1007/3-540-57811-0\_18},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Rub94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SahinalpV94,
author = {S{\"{u}}leyman Cenk Sahinalp and
Uzi Vishkin},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {On a Parallel-Algorithms Method for String Matching Problems},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {22--32},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_3},
doi = {10.1007/3-540-57811-0\_3},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/SahinalpV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Yannakakis94,
author = {Mihalis Yannakakis},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Some Open Problems in Approximation},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {33--39},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_4},
doi = {10.1007/3-540-57811-0\_4},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Yannakakis94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/1994,
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0},
doi = {10.1007/3-540-57811-0},
isbn = {3-540-57811-0},
timestamp = {Fri, 17 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/1994.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-04-25 00:38 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:
