Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Claire Mathieu
@article{DBLP:journals/mp/MathieuV24,
author = {Claire Mathieu and
Victor Verdugo},
title = {Apportionment with parity constraints},
journal = {Math. Program.},
volume = {203},
number = {1},
pages = {135--168},
year = {2024},
url = {https://doi.org/10.1007/s10107-022-01918-0},
doi = {10.1007/S10107-022-01918-0},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/MathieuV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KleinMZ23,
author = {Philip N. Klein and
Claire Mathieu and
Hang Zhou},
title = {Correlation Clustering and Two-Edge-Connected Augmentation for Planar
Graphs},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3024--3057},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01128-w},
doi = {10.1007/S00453-023-01128-W},
timestamp = {Thu, 05 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KleinMZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/HuangMMV23,
author = {Chien{-}Chung Huang and
Mathieu Mari and
Claire Mathieu and
Jens Vygen},
title = {Approximating Maximum Integral Multiflows on Bounded Genus Graphs},
journal = {Discret. Comput. Geom.},
volume = {70},
number = {4},
pages = {1266--1291},
year = {2023},
url = {https://doi.org/10.1007/s00454-023-00552-7},
doi = {10.1007/S00454-023-00552-7},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/HuangMMV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/ZhaoAAMMR23,
author = {Fuheng Zhao and
Divyakant Agrawal and
Amr El Abbadi and
Ahmed Metwally and
Claire Mathieu and
Michel de Rougemont},
title = {Errata for {\textbackslash}},
journal = {Proc. {VLDB} Endow.},
volume = {17},
number = {4},
pages = {643},
year = {2023},
url = {https://www.vldb.org/pvldb/vol17/p643-zhao.pdf},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pvldb/ZhaoAAMMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MathieuZ23,
author = {Claire Mathieu and
Hang Zhou},
title = {A simple algorithm for graph reconstruction},
journal = {Random Struct. Algorithms},
volume = {63},
number = {2},
pages = {512--532},
year = {2023},
url = {https://doi.org/10.1002/rsa.21143},
doi = {10.1002/RSA.21143},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MathieuZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MathieuZ23,
author = {Claire Mathieu and
Hang Zhou},
title = {A {PTAS} for Capacitated Vehicle Routing on Trees},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {2},
pages = {17:1--17:28},
year = {2023},
url = {https://doi.org/10.1145/3575799},
doi = {10.1145/3575799},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/MathieuZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Mathieu023,
author = {Claire Mathieu and
Hang Zhou},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {A Tight (1.5+{\(\epsilon\)})-Approximation for Unsplittable Capacitated
Vehicle Routing on Trees},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {91:1--91:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.91},
doi = {10.4230/LIPICS.ICALP.2023.91},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Mathieu023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001M023,
author = {Fabrizio Grandoni and
Claire Mathieu and
Hang Zhou},
editor = {Yael Tauman Kalai},
title = {Unsplittable Euclidean Capacitated Vehicle Routing: {A} (2+{\(\epsilon\)})-Approximation
Algorithm},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {63:1--63:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.63},
doi = {10.4230/LIPICS.ITCS.2023.63},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/0001M023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DufayM023,
author = {Marc Dufay and
Claire Mathieu and
Hang Zhou},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {An Approximation Algorithm for Distance-Constrained Vehicle Routing
on Trees},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {27:1--27:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.27},
doi = {10.4230/LIPICS.STACS.2023.27},
timestamp = {Fri, 03 Mar 2023 12:10:30 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DufayM023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-11175,
author = {Claire Mathieu and
Michel de Rougemont},
title = {Testing frequency distributions in a stream},
journal = {CoRR},
volume = {abs/2309.11175},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.11175},
doi = {10.48550/ARXIV.2309.11175},
eprinttype = {arXiv},
eprint = {2309.11175},
timestamp = {Mon, 25 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-11175.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-12623,
author = {Fuheng Zhao and
Divyakant Agrawal and
Amr El Abbadi and
Claire Mathieu and
Ahmed Metwally and
Michel de Rougemont},
title = {A Detailed Analysis of the SpaceSaving{\(\pm\)} Family of Algorithms
with Bounded Deletions},
journal = {CoRR},
volume = {abs/2309.12623},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.12623},
doi = {10.48550/ARXIV.2309.12623},
eprinttype = {arXiv},
eprint = {2309.12623},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-12623.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Mathieu022,
author = {Claire Mathieu and
Hang Zhou},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {A {PTAS} for Capacitated Vehicle Routing on Trees},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {95:1--95:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.95},
doi = {10.4230/LIPICS.ICALP.2022.95},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Mathieu022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05691,
author = {Claire Mathieu and
Hang Zhou},
title = {A Tight 3/2+{\(\epsilon\)}-Approximation for Unsplittable Capacitated
Vehicle Routing on Trees},
journal = {CoRR},
volume = {abs/2202.05691},
year = {2022},
url = {https://arxiv.org/abs/2202.05691},
eprinttype = {arXiv},
eprint = {2202.05691},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-05691.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-05520,
author = {Fabrizio Grandoni and
Claire Mathieu and
Hang Zhou},
title = {Unsplittable Euclidean Capacitated Vehicle Routing: {A} (2+{\(\epsilon\)})-Approximation
Algorithm},
journal = {CoRR},
volume = {abs/2209.05520},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.05520},
doi = {10.48550/ARXIV.2209.05520},
eprinttype = {arXiv},
eprint = {2209.05520},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-05520.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-03811,
author = {Marc Dufay and
Claire Mathieu and
Hang Zhou},
title = {An Approximation Algorithm for Distance-Constrained Vehicle Routing
on Trees},
journal = {CoRR},
volume = {abs/2210.03811},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.03811},
doi = {10.48550/ARXIV.2210.03811},
eprinttype = {arXiv},
eprint = {2210.03811},
timestamp = {Wed, 12 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-03811.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/netsci/MathieuR21,
author = {Claire Mathieu and
Michel de Rougemont},
title = {Large very dense subgraphs in a stream of edges},
journal = {Netw. Sci.},
volume = {9},
number = {4},
pages = {403--424},
year = {2021},
url = {https://doi.org/10.1017/nws.2021.17},
doi = {10.1017/NWS.2021.17},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/netsci/MathieuR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/MaurasCDTFMOV21,
author = {Simon Mauras and
Vincent Cohen{-}Addad and
Guillaume Duboc and
Max Dupr{\'{e}} la Tour and
Paolo Frasca and
Claire Mathieu and
Lulla Opatowski and
Laurent Viennot},
title = {Mitigating {COVID-19} outbreaks in workplaces and schools by hybrid
telecommuting},
journal = {PLoS Comput. Biol.},
volume = {17},
number = {8},
year = {2021},
url = {https://doi.org/10.1371/journal.pcbi.1009264},
doi = {10.1371/JOURNAL.PCBI.1009264},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ploscb/MaurasCDTFMOV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HuangMMSV21,
author = {Chien{-}Chung Huang and
Mathieu Mari and
Claire Mathieu and
Kevin Schewior and
Jens Vygen},
title = {An Approximation Algorithm for Fully Planar Edge-Disjoint Paths},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {752--769},
year = {2021},
url = {https://doi.org/10.1137/20M1319401},
doi = {10.1137/20M1319401},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HuangMMSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Mathieu021,
author = {Claire Mathieu and
Hang Zhou},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {A Simple Algorithm for Graph Reconstruction},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {68:1--68:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.68},
doi = {10.4230/LIPICS.ESA.2021.68},
timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
biburl = {https://dblp.org/rec/conf/esa/Mathieu021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/GimbertMM21,
author = {Hugo Gimbert and
Claire Mathieu and
Simon Mauras},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {Two-Sided Matching Markets with Strongly Correlated Preferences},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {3--17},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_1},
doi = {10.1007/978-3-030-86593-1\_1},
timestamp = {Tue, 14 Sep 2021 19:09:35 +0200},
biburl = {https://dblp.org/rec/conf/fct/GimbertMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HuangMMV21,
author = {Chien{-}Chung Huang and
Mathieu Mari and
Claire Mathieu and
Jens Vygen},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Approximating Maximum Integral Multiflows on Bounded Genus Graphs},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {80:1--80:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.80},
doi = {10.4230/LIPICS.ICALP.2021.80},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/HuangMMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Mathieu021,
author = {Claire Mathieu and
Hang Zhou},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Probabilistic Analysis of Euclidean Capacitated Vehicle Routing},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {43:1--43:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.43},
doi = {10.4230/LIPICS.ISAAC.2021.43},
timestamp = {Tue, 30 Nov 2021 14:09:45 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Mathieu021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MathieuRYY21,
author = {Claire Mathieu and
Rajmohan Rajaraman and
Neal E. Young and
Arman Yousefi},
editor = {D{\'{a}}niel Marx},
title = {Competitive Data-Structure Dynamization},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2269--2287},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.135},
doi = {10.1137/1.9781611976465.135},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/MathieuRYY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-04137,
author = {Claire Mathieu and
Victor Verdugo},
title = {Apportionment with Parity Constraints},
journal = {CoRR},
volume = {abs/2108.04137},
year = {2021},
url = {https://arxiv.org/abs/2108.04137},
eprinttype = {arXiv},
eprint = {2108.04137},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-04137.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-06958,
author = {Claire Mathieu and
Hang Zhou},
title = {Probabilistic Analysis of Euclidean Capacitated Vehicle Routing},
journal = {CoRR},
volume = {abs/2109.06958},
year = {2021},
url = {https://arxiv.org/abs/2109.06958},
eprinttype = {arXiv},
eprint = {2109.06958},
timestamp = {Wed, 22 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-06958.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-09089,
author = {Hugo Gimbert and
Claire Mathieu and
Simon Mauras},
title = {Constrained School Choice with Incomplete Information},
journal = {CoRR},
volume = {abs/2109.09089},
year = {2021},
url = {https://arxiv.org/abs/2109.09089},
eprinttype = {arXiv},
eprint = {2109.09089},
timestamp = {Mon, 27 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-09089.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-03735,
author = {Claire Mathieu and
Hang Zhou},
title = {A {PTAS} for Capacitated Vehicle Routing on Trees},
journal = {CoRR},
volume = {abs/2111.03735},
year = {2021},
url = {https://arxiv.org/abs/2111.03735},
eprinttype = {arXiv},
eprint = {2111.03735},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-03735.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-04549,
author = {Claire Mathieu and
Hang Zhou},
title = {A Simple Algorithm for Graph Reconstruction},
journal = {CoRR},
volume = {abs/2112.04549},
year = {2021},
url = {https://arxiv.org/abs/2112.04549},
eprinttype = {arXiv},
eprint = {2112.04549},
timestamp = {Mon, 13 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-04549.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HenzingerLM20,
author = {Monika Henzinger and
Dariusz Leniowski and
Claire Mathieu},
title = {Dynamic Clustering to Minimize the Sum of Radii},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3183--3194},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00721-7},
doi = {10.1007/S00453-020-00721-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HenzingerLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fods/MathieuR20,
author = {Claire Mathieu and
Michel de Rougemont},
editor = {Jeannette M. Wing and
David Madigan},
title = {Large Very Dense Subgraphs in a Stream of Edges},
booktitle = {{FODS} '20: {ACM-IMS} Foundations of Data Science Conference, Virtual
Event, USA, October 19-20, 2020},
pages = {107--117},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3412815.3416884},
doi = {10.1145/3412815.3416884},
timestamp = {Mon, 26 Oct 2020 16:30:13 +0100},
biburl = {https://dblp.org/rec/conf/fods/MathieuR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GrozMMV20,
author = {Beno{\^{\i}}t Groz and
Frederik Mallmann{-}Trenn and
Claire Mathieu and
Victor Verdugo},
editor = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {Skyline Computation with Noisy Comparisons},
booktitle = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
Bordeaux, France, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12126},
pages = {289--303},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48966-3\_22},
doi = {10.1007/978-3-030-48966-3\_22},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GrozMMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Cohen-AddadMM20,
author = {Vincent Cohen{-}Addad and
Frederik Mallmann{-}Trenn and
Claire Mathieu},
editor = {Shuchi Chawla},
title = {Instance-Optimality in the Noisy Value-and Comparison-Model},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2124--2143},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.131},
doi = {10.1137/1.9781611975994.131},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/Cohen-AddadMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MathieuM20,
author = {Claire Mathieu and
Simon Mauras},
editor = {Shuchi Chawla},
title = {How to aggregate Top-lists: Approximation algorithms via scores and
average ranks},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2810--2822},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.171},
doi = {10.1137/1.9781611975994.171},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/MathieuM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-01715,
author = {Chien{-}Chung Huang and
Mathieu Mari and
Claire Mathieu and
Kevin Schewior and
Jens Vygen},
title = {An Approximation Algorithm for Fully Planar Edge-Disjoint Paths},
journal = {CoRR},
volume = {abs/2001.01715},
year = {2020},
url = {http://arxiv.org/abs/2001.01715},
eprinttype = {arXiv},
eprint = {2001.01715},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-01715.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-00575,
author = {Chien{-}Chung Huang and
Mathieu Mari and
Claire Mathieu and
Jens Vygen},
title = {Approximating maximum integral multiflows on bounded genus graphs},
journal = {CoRR},
volume = {abs/2005.00575},
year = {2020},
url = {https://arxiv.org/abs/2005.00575},
eprinttype = {arXiv},
eprint = {2005.00575},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-00575.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-07794,
author = {Claire Mathieu and
Michel de Rougemont},
title = {Large Very Dense Subgraphs in a Stream of Edges},
journal = {CoRR},
volume = {abs/2010.07794},
year = {2020},
url = {https://arxiv.org/abs/2010.07794},
eprinttype = {arXiv},
eprint = {2010.07794},
timestamp = {Wed, 21 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-07794.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-02615,
author = {Claire Mathieu and
Rajmohan Rajaraman and
Neal E. Young and
Arman Yousefi},
title = {Competitive Data-Structure Dynamization},
journal = {CoRR},
volume = {abs/2011.02615},
year = {2020},
url = {https://arxiv.org/abs/2011.02615},
eprinttype = {arXiv},
eprint = {2011.02615},
timestamp = {Mon, 09 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-02615.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cohen-AddadKMM19,
author = {Vincent Cohen{-}Addad and
Varun Kanade and
Frederik Mallmann{-}Trenn and
Claire Mathieu},
title = {Hierarchical Clustering: Objective Functions and Algorithms},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {26:1--26:42},
year = {2019},
url = {https://doi.org/10.1145/3321386},
doi = {10.1145/3321386},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cohen-AddadKMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Cohen-AddadKM19,
author = {Vincent Cohen{-}Addad and
Philip N. Klein and
Claire Mathieu},
title = {Local Search Yields Approximation Schemes for k-Means and k-Median
in Euclidean and Minor-Free Metrics},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {2},
pages = {644--667},
year = {2019},
url = {https://doi.org/10.1137/17M112717X},
doi = {10.1137/17M112717X},
timestamp = {Thu, 23 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Cohen-AddadKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HuangMMMM19,
author = {Chien{-}Chung Huang and
Mathieu Mari and
Claire Mathieu and
Joseph S. B. Mitchell and
Nabil H. Mustafa},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {32:1--32:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.32},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.32},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/HuangMMMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-03890,
author = {Hugo Gimbert and
Claire Mathieu and
Simon Mauras},
title = {On popularity-based random matching markets},
journal = {CoRR},
volume = {abs/1904.03890},
year = {2019},
url = {http://arxiv.org/abs/1904.03890},
eprinttype = {arXiv},
eprint = {1904.03890},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-03890.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KurpiszMMMVW18,
author = {Adam Kurpisz and
Monaldo Mastrolilli and
Claire Mathieu and
Tobias M{\"{o}}mke and
Victor Verdugo and
Andreas Wiese},
title = {Semidefinite and linear programming integrality gaps for scheduling
identical machines},
journal = {Math. Program.},
volume = {172},
number = {1-2},
pages = {231--248},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1152-5},
doi = {10.1007/S10107-017-1152-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KurpiszMMMVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KannanMZ18,
author = {Sampath Kannan and
Claire Mathieu and
Hang Zhou},
title = {Graph Reconstruction and Verification},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {4},
pages = {40:1--40:30},
year = {2018},
url = {https://doi.org/10.1145/3199606},
doi = {10.1145/3199606},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KannanMZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FotakisGMS18,
author = {Dimitris Fotakis and
Laurent Gourv{\`{e}}s and
Claire Mathieu and
Abhinav Srivastav},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Covering Clients with Types and Budgets},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {73:1--73:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.73},
doi = {10.4230/LIPICS.ISAAC.2018.73},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FotakisGMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Cohen-AddadKMM18,
author = {Vincent Cohen{-}Addad and
Varun Kanade and
Frederik Mallmann{-}Trenn and
Claire Mathieu},
editor = {Artur Czumaj},
title = {Hierarchical Clustering: Objective Functions and Algorithms},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {378--397},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.26},
doi = {10.1137/1.9781611975031.26},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/Cohen-AddadKMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-08182,
author = {Vincent Cohen{-}Addad and
Frederik Mallmann{-}Trenn and
Claire Mathieu},
title = {Instance-Optimality in the Noisy Value-and Comparison-Model - Accept,
Accept, Strong Accept: Which Papers get in?},
journal = {CoRR},
volume = {abs/1806.08182},
year = {2018},
url = {http://arxiv.org/abs/1806.08182},
eprinttype = {arXiv},
eprint = {1806.08182},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-08182.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01537,
author = {Claire Mathieu and
Simon Mauras},
title = {How to aggregate Top-lists: Score based approximation schemes},
journal = {CoRR},
volume = {abs/1811.01537},
year = {2018},
url = {http://arxiv.org/abs/1811.01537},
eprinttype = {arXiv},
eprint = {1811.01537},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-01537.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AntunesMM17,
author = {Daniel Antunes and
Claire Mathieu and
Nabil H. Mustafa},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for
Planar Graphs},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.8},
doi = {10.4230/LIPICS.ESA.2017.8},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/AntunesMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HenzingerLM17,
author = {Monika Henzinger and
Dariusz Leniowski and
Claire Mathieu},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Dynamic Clustering to Minimize the Sum of Radii},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {48:1--48:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.48},
doi = {10.4230/LIPICS.ESA.2017.48},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/HenzingerLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BenhamoudaLMZ17,
author = {Fabrice Benhamouda and
Tancr{\`{e}}de Lepoint and
Claire Mathieu and
Hang Zhou},
editor = {Philip N. Klein},
title = {Optimization of Bootstrapping in Circuits},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2423--2433},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.160},
doi = {10.1137/1.9781611974782.160},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/BenhamoudaLMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cohen-AddadKMM17,
author = {Vincent Cohen{-}Addad and
Varun Kanade and
Frederik Mallmann{-}Trenn and
Claire Mathieu},
title = {Hierarchical Clustering: Objective Functions and Algorithms},
journal = {CoRR},
volume = {abs/1704.02147},
year = {2017},
url = {http://arxiv.org/abs/1704.02147},
eprinttype = {arXiv},
eprint = {1704.02147},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cohen-AddadKMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerLM17,
author = {Monika Henzinger and
Dariusz Leniowski and
Claire Mathieu},
title = {Dynamic clustering to minimize the sum of radii},
journal = {CoRR},
volume = {abs/1707.02577},
year = {2017},
url = {http://arxiv.org/abs/1707.02577},
eprinttype = {arXiv},
eprint = {1707.02577},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-02058,
author = {Frederik Mallmann{-}Trenn and
Claire Mathieu and
Victor Verdugo},
title = {Skyline Computation with Noisy Comparisons},
journal = {CoRR},
volume = {abs/1710.02058},
year = {2017},
url = {http://arxiv.org/abs/1710.02058},
eprinttype = {arXiv},
eprint = {1710.02058},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-02058.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/MantheyMRU17,
author = {Bodo Manthey and
Claire Mathieu and
Heiko R{\"{o}}glin and
Eli Upfal},
title = {Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl
Seminar 17141)},
journal = {Dagstuhl Reports},
volume = {7},
number = {4},
pages = {1--22},
year = {2017},
url = {https://doi.org/10.4230/DagRep.7.4.1},
doi = {10.4230/DAGREP.7.4.1},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/MantheyMRU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadKM16,
author = {Vincent Cohen{-}Addad and
Philip N. Klein and
Claire Mathieu},
editor = {Irit Dinur},
title = {Local Search Yields Approximation Schemes for k-Means and k-Median
in Euclidean and Minor-Free Metrics},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {353--364},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.46},
doi = {10.1109/FOCS.2016.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FiatKKMZ16,
author = {Amos Fiat and
Anna R. Karlin and
Elias Koutsoupias and
Claire Mathieu and
Rotem Zach},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Carpooling in Social Networks},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {43:1--43:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.43},
doi = {10.4230/LIPICS.ICALP.2016.43},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FiatKKMZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KurpiszMMMVW16,
author = {Adam Kurpisz and
Monaldo Mastrolilli and
Claire Mathieu and
Tobias M{\"{o}}mke and
Victor Verdugo and
Andreas Wiese},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Semidefinite and Linear Programming Integrality Gaps for Scheduling
Identical Machines},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {152--163},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_13},
doi = {10.1007/978-3-319-33461-5\_13},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/KurpiszMMMVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KanadeLLMM16,
author = {Varun Kanade and
Reut Levi and
Zvi Lotker and
Frederik Mallmann{-}Trenn and
Claire Mathieu},
editor = {Robert Krauthgamer},
title = {Distance in the Forest Fire Model How far are you from Eve?},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1602--1620},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch109},
doi = {10.1137/1.9781611974331.CH109},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/KanadeLLMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen-AddadVKMM16,
author = {Vincent Cohen{-}Addad and
{\'{E}}ric Colin de Verdi{\`{e}}re and
Philip N. Klein and
Claire Mathieu and
David Meierfrankenfeld},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Approximating connectivity domination in weighted bounded-genus graphs},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {584--597},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897635},
doi = {10.1145/2897518.2897635},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Cohen-AddadVKMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2016,
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-018-7},
isbn = {978-3-95977-018-7},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cohen-AddadKM16,
author = {Vincent Cohen{-}Addad and
Philip N. Klein and
Claire Mathieu},
title = {The power of local search for clustering},
journal = {CoRR},
volume = {abs/1603.09535},
year = {2016},
url = {http://arxiv.org/abs/1603.09535},
eprinttype = {arXiv},
eprint = {1603.09535},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cohen-AddadKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BenhamoudaLM016,
author = {Fabrice Benhamouda and
Tancr{\`{e}}de Lepoint and
Claire Mathieu and
Hang Zhou},
title = {Optimization of Bootstrapping in Circuits},
journal = {CoRR},
volume = {abs/1608.04535},
year = {2016},
url = {http://arxiv.org/abs/1608.04535},
eprinttype = {arXiv},
eprint = {1608.04535},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BenhamoudaLM016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/EricksonKMM16,
author = {Jeff Erickson and
Philip N. Klein and
D{\'{a}}niel Marx and
Claire Mathieu},
title = {Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar
16221)},
journal = {Dagstuhl Reports},
volume = {6},
number = {5},
pages = {94--116},
year = {2016},
url = {https://doi.org/10.4230/DagRep.6.5.94},
doi = {10.4230/DAGREP.6.5.94},
timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/EricksonKMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BenhamoudaLM016,
author = {Fabrice Benhamouda and
Tancr{\`{e}}de Lepoint and
Claire Mathieu and
Hang Zhou},
title = {Optimization of Bootstrapping in Circuits},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {785},
year = {2016},
url = {http://eprint.iacr.org/2016/785},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BenhamoudaLM016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasM15,
author = {Aparna Das and
Claire Mathieu},
title = {A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated
Vehicle Routing},
journal = {Algorithmica},
volume = {73},
number = {1},
pages = {115--142},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9906-4},
doi = {10.1007/S00453-014-9906-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DasM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Mathieu15,
author = {Claire Mathieu},
title = {The Presburger Award 2016 - Call for Nominations},
journal = {Bull. {EATCS}},
volume = {117},
year = {2015},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/369},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Mathieu15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorradaileKM15,
author = {Glencora Borradaile and
Philip N. Klein and
Claire Mathieu},
title = {A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {3},
pages = {19:1--19:20},
year = {2015},
url = {https://doi.org/10.1145/2629654},
doi = {10.1145/2629654},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BorradaileKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Cohen-AddadM15,
author = {Vincent Cohen{-}Addad and
Claire Mathieu},
editor = {Lars Arge and
J{\'{a}}nos Pach},
title = {Effectiveness of Local Search for Geometric Optimization},
booktitle = {31st International Symposium on Computational Geometry, SoCG 2015,
June 22-25, 2015, Eindhoven, The Netherlands},
series = {LIPIcs},
volume = {34},
pages = {329--343},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.SOCG.2015.329},
doi = {10.4230/LIPICS.SOCG.2015.329},
timestamp = {Wed, 16 Jun 2021 12:03:14 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Cohen-AddadM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KannanM015,
author = {Sampath Kannan and
Claire Mathieu and
Hang Zhou},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Near-Linear Query Complexity for Graph Inference},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {773--784},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_63},
doi = {10.1007/978-3-662-47672-7\_63},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KannanM015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AvinKLMPP15,
author = {Chen Avin and
Barbara Keller and
Zvi Lotker and
Claire Mathieu and
David Peleg and
Yvonne{-}Anne Pignolet},
editor = {Tim Roughgarden},
title = {Homophily and the Glass Ceiling Effect in Social Networks},
booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
pages = {41--50},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2688073.2688097},
doi = {10.1145/2688073.2688097},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AvinKLMPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KleinMZ15,
author = {Philip N. Klein and
Claire Mathieu and
Hang Zhou},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Correlation Clustering and Two-edge-connected Augmentation for Planar
Graphs},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {554--567},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.554},
doi = {10.4230/LIPICS.STACS.2015.554},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KleinMZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MagniezMN14,
author = {Fr{\'{e}}d{\'{e}}ric Magniez and
Claire Mathieu and
Ashwin Nayak},
title = {Recognizing Well-Parenthesized Expressions in the Streaming Model},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {6},
pages = {1880--1905},
year = {2014},
url = {https://doi.org/10.1137/130926122},
doi = {10.1137/130926122},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MagniezMN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/CaryDE0HKKMS14,
author = {Matthew Cary and
Aparna Das and
Benjamin Edelman and
Ioannis Giotis and
Kurtis Heimerl and
Anna R. Karlin and
Scott Duke Kominers and
Claire Mathieu and
Michael Schwarz},
title = {Convergence of Position Auctions under Myopic Best-Response Dynamics},
journal = {{ACM} Trans. Economics and Comput.},
volume = {2},
number = {3},
pages = {9:1--9:20},
year = {2014},
url = {https://doi.org/10.1145/2632226},
doi = {10.1145/2632226},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/CaryDE0HKKMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EisenstatMS14,
author = {David Eisenstat and
Claire Mathieu and
Nicolas Schabanel},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Facility Location in Evolving Metrics},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {8573},
pages = {459--470},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43951-7\_39},
doi = {10.1007/978-3-662-43951-7\_39},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EisenstatMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhareMY14,
author = {Monik Khare and
Claire Mathieu and
Neal E. Young},
editor = {Chandra Chekuri},
title = {First Come First Served for Online Slot Allocation and Huffman Coding},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {445--454},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.33},
doi = {10.1137/1.9781611973402.33},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/KhareMY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenstatKM14,
author = {David Eisenstat and
Philip N. Klein and
Claire Mathieu},
editor = {Chandra Chekuri},
title = {Approximating \emph{k}-center in planar graphs},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {617--627},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.47},
doi = {10.1137/1.9781611973402.47},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenstatKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Cohen-AddadLMM14,
author = {Vincent Cohen{-}Addad and
Zhentao Li and
Claire Mathieu and
Ioannis Milis},
editor = {Evripidis Bampis and
Ola Svensson},
title = {Energy-Efficient Algorithms for Non-preemptive Speed-Scaling},
booktitle = {Approximation and Online Algorithms - 12th International Workshop,
{WAOA} 2014, Wroc{\l}aw, Poland, September 11-12, 2014, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8952},
pages = {107--118},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_10},
doi = {10.1007/978-3-319-18263-6\_10},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Cohen-AddadLMM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KannanMZ14,
author = {Sampath Kannan and
Claire Mathieu and
Hang Zhou},
title = {Graph Verification and Reconstruction via Distance Oracles},
journal = {CoRR},
volume = {abs/1402.4037},
year = {2014},
url = {http://arxiv.org/abs/1402.4037},
eprinttype = {arXiv},
eprint = {1402.4037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KannanMZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cohen-AddadLMM14,
author = {Vincent Cohen{-}Addad and
Zhentao Li and
Claire Mathieu and
Ioannis Milis},
title = {Energy-efficient algorithms for non-preemptive speed-scaling},
journal = {CoRR},
volume = {abs/1402.4111},
year = {2014},
url = {http://arxiv.org/abs/1402.4111},
eprinttype = {arXiv},
eprint = {1402.4111},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cohen-AddadLMM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EisenstatMS14,
author = {David Eisenstat and
Claire Mathieu and
Nicolas Schabanel},
title = {Facility Location in Evolving Metrics},
journal = {CoRR},
volume = {abs/1403.6758},
year = {2014},
url = {http://arxiv.org/abs/1403.6758},
eprinttype = {arXiv},
eprint = {1403.6758},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EisenstatMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BorradaileMM14,
author = {Glencora Borradaile and
Claire Mathieu and
Theresa Migler},
title = {Lower bounds for testing digraph connectivity with one-pass streaming
algorithms},
journal = {CoRR},
volume = {abs/1404.1323},
year = {2014},
url = {http://arxiv.org/abs/1404.1323},
eprinttype = {arXiv},
eprint = {1404.1323},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BorradaileMM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MathieuSY14,
author = {Claire Mathieu and
Carl Staelin and
Neal E. Young},
title = {K-Slot SSTable Stack Compaction},
journal = {CoRR},
volume = {abs/1407.3008},
year = {2014},
url = {http://arxiv.org/abs/1407.3008},
eprinttype = {arXiv},
eprint = {1407.3008},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MathieuSY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Cohen-AddadM14,
author = {Vincent Cohen{-}Addad and
Claire Mathieu},
title = {The Unreasonable Success of Local Search: Geometric Optimization},
journal = {CoRR},
volume = {abs/1410.0553},
year = {2014},
url = {http://arxiv.org/abs/1410.0553},
eprinttype = {arXiv},
eprint = {1410.0553},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Cohen-AddadM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MathieuW13,
author = {Claire Mathieu and
David B. Wilson},
title = {The Min Mean-Weight Cycle in a Random Network},
journal = {Comb. Probab. Comput.},
volume = {22},
number = {5},
pages = {763--782},
year = {2013},
url = {https://doi.org/10.1017/S0963548313000229},
doi = {10.1017/S0963548313000229},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/MathieuW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AvitabileMP13,
author = {Tess Avitabile and
Claire Mathieu and
Laura H. Parkinson},
title = {Online constrained optimization with recourse},
journal = {Inf. Process. Lett.},
volume = {113},
number = {3},
pages = {81--86},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.09.011},
doi = {10.1016/J.IPL.2012.09.011},
timestamp = {Thu, 16 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AvitabileMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MathieuZ13,
author = {Claire Mathieu and
Hang Zhou},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Graph Reconstruction via Distance Oracles},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {733--744},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_62},
doi = {10.1007/978-3-642-39206-1\_62},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MathieuZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-7270,
author = {Glencora Borradaile and
Philip N. Klein and
Claire Mathieu},
title = {A polynomial-time approximation scheme for Euclidean Steiner forest},
journal = {CoRR},
volume = {abs/1302.7270},
year = {2013},
url = {http://arxiv.org/abs/1302.7270},
eprinttype = {arXiv},
eprint = {1302.7270},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-7270.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-6588,
author = {Claire Mathieu and
Hang Zhou},
title = {Graph Reconstruction via Distance Oracles},
journal = {CoRR},
volume = {abs/1304.6588},
year = {2013},
url = {http://arxiv.org/abs/1304.6588},
eprinttype = {arXiv},
eprint = {1304.6588},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-6588.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KhareMY13,
author = {Monik Khare and
Claire Mathieu and
Neal E. Young},
title = {First-Come-First-Served for Online Slot Allocation and Huffman Coding},
journal = {CoRR},
volume = {abs/1307.5296},
year = {2013},
url = {http://arxiv.org/abs/1307.5296},
eprinttype = {arXiv},
eprint = {1307.5296},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KhareMY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BorradaileKMM13,
author = {Glencora Borradaile and
Philip N. Klein and
D{\'{a}}niel Marx and
Claire Mathieu},
title = {Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar
13421)},
journal = {Dagstuhl Reports},
volume = {3},
number = {10},
pages = {36--57},
year = {2013},
url = {https://doi.org/10.4230/DagRep.3.10.36},
doi = {10.4230/DAGREP.3.10.36},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BorradaileKMM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CoriMR12,
author = {Robert Cori and
Claire Mathieu and
John Michael Robson},
title = {On the Number of Indecomposable Permutations with a Given Number of
Cycles},
journal = {Electron. J. Comb.},
volume = {19},
number = {1},
pages = {49},
year = {2012},
url = {https://doi.org/10.37236/2071},
doi = {10.37236/2071},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CoriMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MathieuO12,
author = {Claire Mathieu and
Olga Ohrimenko},
title = {Lower bounds for randomized algorithms for online chain partitioning},
journal = {Inf. Process. Lett.},
volume = {112},
number = {17-18},
pages = {663--666},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.05.010},
doi = {10.1016/J.IPL.2012.05.010},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MathieuO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolinMY12,
author = {Mordecai J. Golin and
Claire Mathieu and
Neal E. Young},
title = {Huffman Coding with Letter Costs: {A} Linear-Time Approximation Scheme},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {3},
pages = {684--713},
year = {2012},
url = {https://doi.org/10.1137/100794092},
doi = {10.1137/100794092},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GolinMY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KonradMM12,
author = {Christian Konrad and
Fr{\'{e}}d{\'{e}}ric Magniez and
Claire Mathieu},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Maximum Matching in Semi-streaming with Few Passes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {231--242},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_20},
doi = {10.1007/978-3-642-32512-0\_20},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/KonradMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenstatKM12,
author = {David Eisenstat and
Philip N. Klein and
Claire Mathieu},
editor = {Yuval Rabani},
title = {An efficient polynomial-time approximation scheme for Steiner forest
in planar graphs},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {626--638},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.53},
doi = {10.1137/1.9781611973099.53},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenstatKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BateniHKM12,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
Philip N. Klein and
Claire Mathieu},
editor = {Yuval Rabani},
title = {A polynomial-time approximation scheme for planar multiway cut},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {639--655},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.54},
doi = {10.1137/1.9781611973099.54},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BateniHKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-3955,
author = {Claire Mathieu and
David B. Wilson},
title = {The min mean-weight cycle in a random network},
journal = {CoRR},
volume = {abs/1201.3955},
year = {2012},
url = {http://arxiv.org/abs/1201.3955},
eprinttype = {arXiv},
eprint = {1201.3955},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-3955.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KarlinMN11,
author = {Anna R. Karlin and
Claire Mathieu and
C. Thach Nguyen},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {Integrality Gaps of Linear and Semi-Definite Programming Relaxations
for Knapsack},
booktitle = {Integer Programming and Combinatoral Optimization - 15th International
Conference, {IPCO} 2011, New York, NY, USA, June 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6655},
pages = {301--314},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_24},
doi = {10.1007/978-3-642-20807-2\_24},
timestamp = {Tue, 29 Dec 2020 18:40:14 +0100},
biburl = {https://dblp.org/rec/conf/ipco/KarlinMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1320,
author = {David Eisenstat and
Philip N. Klein and
Claire Mathieu},
title = {An efficient polynomial-time approximation scheme for Steiner forest
in planar graphs},
journal = {CoRR},
volume = {abs/1110.1320},
year = {2011},
url = {http://arxiv.org/abs/1110.1320},
eprinttype = {arXiv},
eprint = {1110.1320},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-1320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-0184,
author = {Christian Konrad and
Fr{\'{e}}d{\'{e}}ric Magniez and
Claire Mathieu},
title = {Maximum Matching in Semi-Streaming with Few Passes},
journal = {CoRR},
volume = {abs/1112.0184},
year = {2011},
url = {http://arxiv.org/abs/1112.0184},
eprinttype = {arXiv},
eprint = {1112.0184},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-0184.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/JansenMSY11,
author = {Klaus Jansen and
Claire Mathieu and
Hadas Shachnai and
Neal E. Young},
title = {Packing and Scheduling Algorithms for Information and Communication
Services (Dagstuhl Seminar 11091)},
journal = {Dagstuhl Reports},
volume = {1},
number = {2},
pages = {67--93},
year = {2011},
url = {https://doi.org/10.4230/DagRep.1.2.67},
doi = {10.4230/DAGREP.1.2.67},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/JansenMSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Mathieu10,
author = {Claire Mathieu},
title = {Foreword to special issue {SODA} 2009},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {2},
pages = {23:1},
year = {2010},
url = {https://doi.org/10.1145/1721837.1721839},
doi = {10.1145/1721837.1721839},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Mathieu10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DasM10,
author = {Aparna Das and
Claire Mathieu},
editor = {Moses Charikar},
title = {A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated
Vehicle Routing},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {390--403},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.33},
doi = {10.1137/1.9781611973075.33},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/DasM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MathieuS10,
author = {Claire Mathieu and
Warren Schudy},
editor = {Moses Charikar},
title = {Correlation Clustering with Noisy Input},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {712--728},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.58},
doi = {10.1137/1.9781611973075.58},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/MathieuS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MathieuSS10,
author = {Claire Mathieu and
Ocan Sankur and
Warren Schudy},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Online Correlation Clustering},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {573--584},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2486},
doi = {10.4230/LIPICS.STACS.2010.2486},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MathieuSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MagniezMN10,
author = {Fr{\'{e}}d{\'{e}}ric Magniez and
Claire Mathieu and
Ashwin Nayak},
editor = {Leonard J. Schulman},
title = {Recognizing well-parenthesized expressions in the streaming model},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {261--270},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806727},
doi = {10.1145/1806689.1806727},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MagniezMN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DasMM10,
author = {Aparna Das and
Claire Mathieu and
Shay Mozes},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {The Train Delivery Problem - Vehicle Routing Meets Bin Packing},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {94--105},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_9},
doi = {10.1007/978-3-642-18318-8\_9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DasMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/MathieuV10,
author = {Claire Mathieu and
Adrian Vladu},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Online Ranking for Tournament Graphs},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {201--212},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_18},
doi = {10.1007/978-3-642-18318-8\_18},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/MathieuV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-0920,
author = {Claire Mathieu and
Ocan Sankur and
Warren Schudy},
title = {Online Correlation Clustering},
journal = {CoRR},
volume = {abs/1001.0920},
year = {2010},
url = {http://arxiv.org/abs/1001.0920},
eprinttype = {arXiv},
eprint = {1001.0920},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-0920.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1283,
author = {Anna R. Karlin and
Claire Mathieu and
C. Thach Nguyen},
title = {Integrality Gaps of Linear and Semi-definite Programming Relaxations
for Knapsack},
journal = {CoRR},
volume = {abs/1007.1283},
year = {2010},
url = {http://arxiv.org/abs/1007.1283},
eprinttype = {arXiv},
eprint = {1007.1283},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1283.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DasK09,
author = {Aparna Das and
Claire Kenyon{-}Mathieu},
title = {On Hierarchical Diameter-Clustering and the Supplier Problem},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {497--511},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9186-6},
doi = {10.1007/S00224-009-9186-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DasK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KenyonRS09,
author = {Claire Kenyon and
Yuval Rabani and
Alistair Sinclair},
title = {Low Distortion Maps Between Point Sets},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {4},
pages = {1617--1636},
year = {2009},
url = {https://doi.org/10.1137/080712921},
doi = {10.1137/080712921},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KenyonRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorradaileKM09,
author = {Glencora Borradaile and
Philip N. Klein and
Claire Mathieu},
title = {An \emph{O}(\emph{n} log \emph{n}) approximation scheme for Steiner
tree in planar graphs},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {3},
pages = {31:1--31:31},
year = {2009},
url = {https://doi.org/10.1145/1541885.1541892},
doi = {10.1145/1541885.1541892},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BorradaileKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MathieuS09,
author = {Claire Mathieu and
Alistair Sinclair},
editor = {Michael Mitzenmacher},
title = {Sherali-adams relaxations of the matching polytope},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {293--302},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536456},
doi = {10.1145/1536414.1536456},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MathieuS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2009,
editor = {Claire Mathieu},
title = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068},
doi = {10.1137/1.9781611973068},
isbn = {978-0-89871-680-1},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-3633,
author = {Aparna Das and
Claire Mathieu and
Daniel Ricketts},
title = {Maximizing profit using recommender systems},
journal = {CoRR},
volume = {abs/0908.3633},
year = {2009},
url = {http://arxiv.org/abs/0908.3633},
eprinttype = {arXiv},
eprint = {0908.3633},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-3633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-3291,
author = {Fr{\'{e}}d{\'{e}}ric Magniez and
Claire Mathieu and
Ashwin Nayak},
title = {Recognizing well-parenthesized expressions in the streaming model},
journal = {CoRR},
volume = {abs/0911.3291},
year = {2009},
url = {http://arxiv.org/abs/0911.3291},
eprinttype = {arXiv},
eprint = {0911.3291},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-3291.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MagniezMN09,
author = {Fr{\'{e}}d{\'{e}}ric Magniez and
Claire Mathieu and
Ashwin Nayak},
title = {Recognizing well-parenthesized expressions in the streaming model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-119}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/119},
eprinttype = {ECCC},
eprint = {TR09-119},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MagniezMN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChrobakKNY08,
author = {Marek Chrobak and
Claire Kenyon and
John Noga and
Neal E. Young},
title = {Incremental Medians via Online Bidding},
journal = {Algorithmica},
volume = {50},
number = {4},
pages = {455--478},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9005-x},
doi = {10.1007/S00453-007-9005-X},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChrobakKNY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MathieuP08,
author = {Claire Mathieu and
Charalampos Papamanthou},
title = {Distortion lower bounds for line embeddings},
journal = {Inf. Process. Lett.},
volume = {108},
number = {4},
pages = {175--178},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.05.003},
doi = {10.1016/J.IPL.2008.05.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MathieuP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/BirnbaumM08,
author = {Benjamin E. Birnbaum and
Claire Mathieu},
title = {On-line bipartite matching made simple},
journal = {{SIGACT} News},
volume = {39},
number = {1},
pages = {80--87},
year = {2008},
url = {https://doi.org/10.1145/1360443.1360462},
doi = {10.1145/1360443.1360462},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/BirnbaumM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BarbayK08,
author = {J{\'{e}}r{\'{e}}my Barbay and
Claire Kenyon},
title = {Alternation and redundancy analysis of the intersection problem},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {1},
pages = {4:1--4:18},
year = {2008},
url = {https://doi.org/10.1145/1328911.1328915},
doi = {10.1145/1328911.1328915},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BarbayK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KatrielKU08,
author = {Irit Katriel and
Claire Kenyon{-}Mathieu and
Eli Upfal},
title = {Commitment under uncertainty: Two-stage stochastic matching problems},
journal = {Theor. Comput. Sci.},
volume = {408},
number = {2-3},
pages = {213--223},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.08.010},
doi = {10.1016/J.TCS.2008.08.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KatrielKU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorradaileKM08,
author = {Glencora Borradaile and
Philip N. Klein and
Claire Mathieu},
title = {A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {115--124},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.59},
doi = {10.1109/FOCS.2008.59},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BorradaileKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AzarBKMN08,
author = {Yossi Azar and
Benjamin E. Birnbaum and
Anna R. Karlin and
Claire Mathieu and
C. Thach Nguyen},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Improved Approximation Algorithms for Budgeted Allocations},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {186--197},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_16},
doi = {10.1007/978-3-540-70575-8\_16},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AzarBKMN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MathieuS08,
author = {Claire Mathieu and
Warren Schudy},
editor = {Shang{-}Hua Teng},
title = {Yet another algorithm for dense max cut: go greedy},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {176--182},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347102},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/MathieuS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/CharikarKMNS08,
author = {Moses Charikar and
Howard J. Karloff and
Claire Mathieu and
Joseph Naor and
Michael E. Saks},
editor = {Friedhelm Meyer auf der Heide and
Nir Shavit},
title = {Online multicast with egalitarian cost sharing},
booktitle = {{SPAA} 2008: Proceedings of the 20th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Munich, Germany, June 14-16, 2008},
pages = {70--76},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1378533.1378544},
doi = {10.1145/1378533.1378544},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/CharikarKMNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-1595,
author = {Aparna Das and
Claire Mathieu},
title = {A quasi-polynomial time approximation scheme for Euclidean capacitated
vehicle routing},
journal = {CoRR},
volume = {abs/0812.1595},
year = {2008},
url = {http://arxiv.org/abs/0812.1595},
eprinttype = {arXiv},
eprint = {0812.1595},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-1595.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KatrielKU07,
author = {Irit Katriel and
Claire Kenyon{-}Mathieu and
Eli Upfal},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {171--182},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_17},
doi = {10.1007/978-3-540-73420-8\_17},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KatrielKU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/CaryDEGHKMS07,
author = {Matthew Cary and
Aparna Das and
Benjamin Edelman and
Ioannis Giotis and
Kurtis Heimerl and
Anna R. Karlin and
Claire Mathieu and
Michael Schwarz},
editor = {Jeffrey K. MacKie{-}Mason and
David C. Parkes and
Paul Resnick},
title = {Greedy bidding strategies for keyword auctions},
booktitle = {Proceedings 8th {ACM} Conference on Electronic Commerce (EC-2007),
San Diego, California, USA, June 11-15, 2007},
pages = {262--271},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250910.1250949},
doi = {10.1145/1250910.1250949},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/CaryDEGHKMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/VegaK07,
author = {Wenceslas Fernandez de la Vega and
Claire Kenyon{-}Mathieu},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Linear programming relaxations of maxcut},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {53--61},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283390},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/VegaK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BorradaileKK07,
author = {Glencora Borradaile and
Claire Kenyon{-}Mathieu and
Philip N. Klein},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {A polynomial-time approximation scheme for Steiner tree in planar
graphs},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1285--1294},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283521},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BorradaileKK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kenyon-MathieuS07,
author = {Claire Kenyon{-}Mathieu and
Warren Schudy},
editor = {David S. Johnson and
Uriel Feige},
title = {How to rank with few errors},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {95--103},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250806},
doi = {10.1145/1250790.1250806},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kenyon-MathieuS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BorradaileKM07,
author = {Glencora Borradaile and
Philip N. Klein and
Claire Mathieu},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {Steiner Tree in Planar Graphs: An \emph{O} {(} \emph{n} log \emph{n}
{)} Approximation Scheme with Singly-Exponential Dependence on Epsilon},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {275--286},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_25},
doi = {10.1007/978-3-540-73951-7\_25},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BorradaileKM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChrobakKY06,
author = {Marek Chrobak and
Claire Kenyon and
Neal E. Young},
title = {The reverse greedy algorithm for the metric \emph{k}-median problem},
journal = {Inf. Process. Lett.},
volume = {97},
number = {2},
pages = {68--72},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.09.009},
doi = {10.1016/J.IPL.2005.09.009},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChrobakKY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CsirikJKOSW06,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
James B. Orlin and
Peter W. Shor and
Richard R. Weber},
title = {On the Sum-of-Squares algorithm for bin packing},
journal = {J. {ACM}},
volume = {53},
number = {1},
pages = {1--65},
year = {2006},
url = {https://doi.org/10.1145/1120582.1120583},
doi = {10.1145/1120582.1120583},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CsirikJKOSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BansalCKS06,
author = {Nikhil Bansal and
Jos{\'{e}} R. Correa and
Claire Kenyon and
Maxim Sviridenko},
title = {Bin Packing in Multiple Dimensions: Inapproximability Results and
Approximation Schemes},
journal = {Math. Oper. Res.},
volume = {31},
number = {1},
pages = {31--49},
year = {2006},
url = {https://doi.org/10.1287/moor.1050.0168},
doi = {10.1287/MOOR.1050.0168},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/BansalCKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/ChrobakK06,
author = {Marek Chrobak and
Claire Kenyon{-}Mathieu},
title = {{SIGACT} news online algorithms column 10: competitiveness via doubling},
journal = {{SIGACT} News},
volume = {37},
number = {4},
pages = {115--126},
year = {2006},
url = {https://doi.org/10.1145/1189056.1189078},
doi = {10.1145/1189056.1189078},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/ChrobakK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/KenyonS06,
author = {Claire Kenyon and
Meinolf Sellmann},
editor = {J. Christopher Beck and
Barbara M. Smith},
title = {Plan {B:} Uncertainty/Time Trade-Offs for Linear and Integer Programming},
booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
for Combinatorial Optimization Problems, Third International Conference,
{CPAIOR} 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3990},
pages = {126--138},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11757375\_12},
doi = {10.1007/11757375\_12},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/KenyonS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ChrobakKNY06,
author = {Marek Chrobak and
Claire Kenyon and
John Noga and
Neal E. Young},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Oblivious Medians Via Online Bidding},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {311--322},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_31},
doi = {10.1007/11682462\_31},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/ChrobakKNY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DasK06,
author = {Aparna Das and
Claire Kenyon},
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {On Hierarchical Diameter-Clustering, and the Supplier Problem},
booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
pages = {132--145},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125\_11},
doi = {10.1007/11970125\_11},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DasK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:series/lncs/3484,
editor = {Evripidis Bampis and
Klaus Jansen and
Claire Kenyon},
title = {Efficient Approximation and Online Algorithms - Recent Progress on
Classical Combinatorial Optimization Problems and New Applications},
series = {Lecture Notes in Computer Science},
volume = {3484},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11671541},
doi = {10.1007/11671541},
isbn = {978-3-540-32212-2},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/lncs/3484.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Kenyon-MathieuS06,
author = {Claire Kenyon{-}Mathieu and
Warren Schudy},
title = {How to rank with few errors: {A} {PTAS} for Weighted Feedback Arc
Set on Tournaments},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-144}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-144/index.html},
eprinttype = {ECCC},
eprint = {TR06-144},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Kenyon-MathieuS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ChrobakKY05,
author = {Marek Chrobak and
Claire Kenyon and
Neal E. Young},
editor = {Lusheng Wang},
title = {The Reverse Greedy Algorithm for the Metric \emph{K}-Median Problem},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {654--660},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_66},
doi = {10.1007/11533719\_66},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ChrobakKY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuruswamiHKKKM05,
author = {Venkatesan Guruswami and
Jason D. Hartline and
Anna R. Karlin and
David Kempe and
Claire Kenyon and
Frank McSherry},
title = {On profit-maximizing envy-free pricing},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {1164--1173},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070598},
timestamp = {Mon, 07 Nov 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuruswamiHKKKM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504103,
author = {Marek Chrobak and
Claire Kenyon and
John Noga and
Neal E. Young},
title = {Oblivious Medians via Online Bidding},
journal = {CoRR},
volume = {abs/cs/0504103},
year = {2005},
url = {http://arxiv.org/abs/cs/0504103},
eprinttype = {arXiv},
eprint = {cs/0504103},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0504103.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504104,
author = {Marek Chrobak and
Claire Kenyon and
Neal E. Young},
title = {The reverse greedy algorithm for the metric k-median problem},
journal = {CoRR},
volume = {abs/cs/0504104},
year = {2005},
url = {http://arxiv.org/abs/cs/0504104},
eprinttype = {arXiv},
eprint = {cs/0504104},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0504104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0509031,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon},
title = {On the Worst-case Performance of the Sum-of-Squares Algorithm for
Bin Packing},
journal = {CoRR},
volume = {abs/cs/0509031},
year = {2005},
url = {http://arxiv.org/abs/cs/0509031},
eprinttype = {arXiv},
eprint = {cs/0509031},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0509031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KenyonK04,
author = {Claire Kenyon and
Samuel Kutin},
title = {Sensitivity, block sensitivity, and l-block sensitivity of boolean
functions},
journal = {Inf. Comput.},
volume = {189},
number = {1},
pages = {43--53},
year = {2004},
url = {https://doi.org/10.1016/j.ic.2002.12.001},
doi = {10.1016/J.IC.2002.12.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KenyonK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchsbaumKKRT04,
author = {Adam L. Buchsbaum and
Howard J. Karloff and
Claire Kenyon and
Nick Reingold and
Mikkel Thorup},
title = {{OPT} Versus {LOAD} in Dynamic Storage Allocation},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {3},
pages = {632--646},
year = {2004},
url = {https://doi.org/10.1137/S0097539703423941},
doi = {10.1137/S0097539703423941},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuchsbaumKKRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CorreaK04,
author = {Jos{\'{e}} R. Correa and
Claire Kenyon},
editor = {J. Ian Munro},
title = {Approximation schemes for multidimensional packing},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {186--195},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982820},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CorreaK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/VegaKK04,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Claire Kenyon},
editor = {J. Ian Munro},
title = {Approximation schemes for Metric Bisection and partitioning},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {506--515},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982864},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/VegaKK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kenyon04,
author = {Claire Kenyon},
editor = {Volker Diekert and
Michel Habib},
title = {Approximation Schemes for Metric Clustering Problems},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {1--3},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_1},
doi = {10.1007/978-3-540-24749-4\_1},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kenyon04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KenyonRS04,
author = {Claire Kenyon and
Yuval Rabani and
Alistair Sinclair},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Low distortion maps between point sets},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {272--280},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007398},
doi = {10.1145/1007352.1007398},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KenyonRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KenyonS03,
author = {Claire Kenyon and
Nicolas Schabanel},
title = {The Data Broadcast Problem with Non-Uniform Transmission Times},
journal = {Algorithmica},
volume = {35},
number = {2},
pages = {146--175},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-0990-5},
doi = {10.1007/S00453-002-0990-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KenyonS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarlinKR03,
author = {Anna R. Karlin and
Claire Kenyon and
Dana Randall},
title = {Dynamic {TCP} Acknowledgment and Other Stories about e/(e-1)},
journal = {Algorithmica},
volume = {36},
number = {3},
pages = {209--224},
year = {2003},
timestamp = {Thu, 28 Nov 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KarlinKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BarbayK03,
author = {J{\'{e}}r{\'{e}}my Barbay and
Claire Kenyon},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {Deterministic Algorithm for the t-Threshold Set Problem},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {575--584},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_59},
doi = {10.1007/978-3-540-24587-2\_59},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BarbayK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/KarpK03,
author = {Richard M. Karp and
Claire Kenyon},
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Amit Sahai},
title = {A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms
and Techniques, 6th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2764},
pages = {329--340},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45198-3\_28},
doi = {10.1007/978-3-540-45198-3\_28},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/KarpK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/VegaKKR03,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Claire Kenyon and
Yuval Rabani},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Approximation schemes for clustering problems},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {50--58},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780550},
doi = {10.1145/780542.780550},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/VegaKKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuchsbaumKKRT03,
author = {Adam L. Buchsbaum and
Howard J. Karloff and
Claire Kenyon and
Nick Reingold and
Mikkel Thorup},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {{OPT} versus {LOAD} in dynamic storage allocation},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {556--564},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780624},
doi = {10.1145/780542.780624},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BuchsbaumKKRT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AmouraBKM02,
author = {Abdel Krim Amoura and
Evripidis Bampis and
Claire Kenyon and
Yannis Manoussakis},
title = {Scheduling Independent Multiprocessor Tasks},
journal = {Algorithmica},
volume = {32},
number = {2},
pages = {247--261},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0076-9},
doi = {10.1007/S00453-001-0076-9},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AmouraBKM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KenyonM02,
author = {Claire Kenyon and
Michael Mitzenmacher},
title = {Linear waste of best fit bin packing on skewed distributions},
journal = {Random Struct. Algorithms},
volume = {20},
number = {3},
pages = {441--464},
year = {2002},
url = {https://doi.org/10.1002/rsa.10037},
doi = {10.1002/RSA.10037},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KenyonM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BarbayK02,
author = {J{\'{e}}r{\'{e}}my Barbay and
Claire Kenyon},
editor = {David Eppstein},
title = {Adaptive intersection and t-threshold problems},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {390--399},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545432},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BarbayK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GolinKY02,
author = {Mordecai J. Golin and
Claire Kenyon and
Neal E. Young},
editor = {John H. Reif},
title = {Huffman coding with unequal letter costs},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {785--791},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510020},
doi = {10.1145/509907.510020},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GolinKY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205012,
author = {Claire Kenyon and
Nicolas Schabanel and
Neal E. Young},
title = {Polynomial-Time Approximation Scheme for Data Broadcast},
journal = {CoRR},
volume = {cs.DS/0205012},
year = {2002},
url = {https://arxiv.org/abs/cs/0205012},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205048,
author = {Mordecai J. Golin and
Claire Kenyon and
Neal E. Young},
title = {Huffman Coding with Unequal Letter Costs},
journal = {CoRR},
volume = {cs.DS/0205048},
year = {2002},
url = {http://arxiv.org/abs/cs.DS/0205048},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205048.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0210013,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
James B. Orlin and
Peter W. Shor and
Richard R. Weber},
title = {On the Sum-of-Squares Algorithm for Bin Packing},
journal = {CoRR},
volume = {cs.DS/0210013},
year = {2002},
url = {https://arxiv.org/abs/cs/0210013},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0210013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-025,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Claire Kenyon and
Yuval Rabani},
title = {Polynomial Time Approximation Schemes for Metric Min-Sum Clustering},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-025}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-025/index.html},
eprinttype = {ECCC},
eprint = {TR02-025},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-041,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Claire Kenyon},
title = {A Polynomial Time Approximation Scheme for Metric {MIN-BISECTION}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-041}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-041/index.html},
eprinttype = {ECCC},
eprint = {TR02-041},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/VegaK01,
author = {Wenceslas Fernandez de la Vega and
Claire Kenyon},
title = {A Randomized Approximation Scheme for Metric {MAX-CUT}},
journal = {J. Comput. Syst. Sci.},
volume = {63},
number = {4},
pages = {531--541},
year = {2001},
url = {https://doi.org/10.1006/jcss.2001.1772},
doi = {10.1006/JCSS.2001.1772},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/VegaK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KenyonMP01,
author = {Claire Kenyon and
Elchanan Mossel and
Yuval Peres},
title = {Glauber Dynamics on Trees and Hyperbolic Graphs},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {568--578},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959933},
doi = {10.1109/SFCS.2001.959933},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KenyonMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CsirikJK01,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon},
editor = {S. Rao Kosaraju},
title = {Better approximation algorithms for bin covering},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {557--566},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365533},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CsirikJK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BarbayK01,
author = {J{\'{e}}r{\'{e}}my Barbay and
Claire Kenyon},
editor = {S. Rao Kosaraju},
title = {On the discrete Bak-Sneppen model of self-organized criticality},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {928--933},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365814},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BarbayK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarlinKR01,
author = {Anna R. Karlin and
Claire Kenyon and
Dana Randall},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Dynamic {TCP} acknowledgement and other stories about e/(e-1)},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {502--509},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380845},
doi = {10.1145/380752.380845},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KarlinKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KenyonR00,
author = {Claire Kenyon and
Eric R{\'{e}}mila},
title = {A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem},
journal = {Math. Oper. Res.},
volume = {25},
number = {4},
pages = {645--656},
year = {2000},
url = {https://doi.org/10.1287/moor.25.4.645.12118},
doi = {10.1287/MOOR.25.4.645.12118},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KenyonR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KenyonM00,
author = {Claire Kenyon and
Michael Mitzenmacher},
title = {Linear Waste of Best Fit Bin Packing on Skewed Distributions},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {582--589},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892326},
doi = {10.1109/SFCS.2000.892326},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KenyonM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AfratiBFJK00,
author = {Foto N. Afrati and
Evripidis Bampis and
Aleksei V. Fishkin and
Klaus Jansen and
Claire Kenyon},
editor = {Sanjiv Kapoor and
Sanjiva Prasad},
title = {Scheduling to Minimize the Average Completion Time of Dedicated Tasks},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15,
2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1974},
pages = {454--464},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44450-5\_37},
doi = {10.1007/3-540-44450-5\_37},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AfratiBFJK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CsirikJKOSW00,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
James B. Orlin and
Peter W. Shor and
Richard R. Weber},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {On the sum-of-squares algorithm for bin packing},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {208--217},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335331},
doi = {10.1145/335305.335331},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CsirikJKOSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KenyonSY00,
author = {Claire Kenyon and
Nicolas Schabanel and
Neal E. Young},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Polynomial-time approximation scheme for data broadcast},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {659--666},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335398},
doi = {10.1145/335305.335398},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KenyonSY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FerreiraKRU99,
author = {Afonso Ferreira and
Claire Kenyon and
Andrew Rau{-}Chaplin and
St{\'{e}}phane Ub{\'{e}}da},
title = {\emph{d}-Dimensional Range Search on Multicomputers},
journal = {Algorithmica},
volume = {24},
number = {3-4},
pages = {195--208},
year = {1999},
url = {https://doi.org/10.1007/PL00008260},
doi = {10.1007/PL00008260},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FerreiraKRU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KarpKW99,
author = {Richard M. Karp and
Claire Kenyon and
Orli Waarts},
title = {Error-resilient {DNA} computation},
journal = {Random Struct. Algorithms},
volume = {15},
number = {3-4},
pages = {450--466},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4\&\#60;450::AID-RSA12\&\#62;3.0.CO;2-2},
doi = {10.1002/(SICI)1098-2418(199910/12)15:3/4\&\#60;450::AID-RSA12\&\#62;3.0.CO;2-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KarpKW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CsirikJKSW99,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
Peter W. Shor and
Richard R. Weber},
editor = {Michael T. Goodrich and
Catherine C. McGeoch},
title = {A Self Organizing Bin Packing Heuristic},
booktitle = {Algorithm Engineering and Experimentation, International Workshop
{ALENEX} '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {1619},
pages = {246--265},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48518-X\_15},
doi = {10.1007/3-540-48518-X\_15},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/alenex/CsirikJKSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AfratiBCKKKMQSSS99,
author = {Foto N. Afrati and
Evripidis Bampis and
Chandra Chekuri and
David R. Karger and
Claire Kenyon and
Sanjeev Khanna and
Ioannis Milis and
Maurice Queyranne and
Martin Skutella and
Clifford Stein and
Maxim Sviridenko},
title = {Approximation Schemes for Minimizing Average Weighted Completion Time
with Release Dates},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {32--44},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814574},
doi = {10.1109/SFFCS.1999.814574},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AfratiBCKKKMQSSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/AfratiBKM99,
author = {Foto N. Afrati and
Evripidis Bampis and
Claire Kenyon and
Ioannis Milis},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {Scheduling on a Constant Number of Machines},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {281--287},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_28},
doi = {10.1007/978-3-540-48413-4\_28},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/AfratiBKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KenyonS99,
author = {Claire Kenyon and
Nicolas Schabanel},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {The Data Broadcast Problem with Non-Uniform Transmission Rimes},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {547--556},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314876},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/KenyonS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/KenyonP98,
author = {Claire Kenyon and
H{\'{e}}l{\`{e}}ne Paugam{-}Moisy},
title = {Multilayer Neural Networks and Polyhedral Dichotomies},
journal = {Ann. Math. Artif. Intell.},
volume = {24},
number = {1-4},
pages = {115--128},
year = {1998},
url = {https://doi.org/10.1023/A:1018997115206},
doi = {10.1023/A:1018997115206},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/KenyonP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KenyonRS98,
author = {Claire Kenyon and
Yuval Rabani and
Alistair Sinclair},
title = {Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of
Best Fit Bin Packing},
journal = {J. Algorithms},
volume = {27},
number = {2},
pages = {218--235},
year = {1998},
url = {https://doi.org/10.1006/jagm.1997.0919},
doi = {10.1006/JAGM.1997.0919},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KenyonRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/VegaK98,
author = {Wenceslas Fernandez de la Vega and
Claire Kenyon},
title = {A Randomized Approximation Scheme for Metric {MAX-CUT}},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {468--471},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743497},
doi = {10.1109/SFCS.1998.743497},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/VegaK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LouchardKS97,
author = {Guy Louchard and
Claire Kenyon and
Ren{\'{e}} Schott},
title = {Data Structures' Maxima},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {4},
pages = {1006--1042},
year = {1997},
url = {https://doi.org/10.1137/S0097539791196603},
doi = {10.1137/S0097539791196603},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LouchardKS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AmouraBKM97,
author = {Abdel Krim Amoura and
Evripidis Bampis and
Claire Kenyon and
Yannis Manoussakis},
editor = {Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Scheduling Independent Multiprocessor Tasks},
booktitle = {Algorithms - {ESA} '97, 5th Annual European Symposium, Graz, Austria,
September 15-17, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1284},
pages = {1--12},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63397-9\_1},
doi = {10.1007/3-540-63397-9\_1},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AmouraBKM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/FerreiraKRU97,
author = {Afonso Ferreira and
Claire Kenyon and
Andrew Rau{-}Chaplin and
St{\'{e}}phane Ub{\'{e}}da},
title = {d-Dimensional Range Search on Multicomputers},
booktitle = {11th International Parallel Processing Symposium {(IPPS} '97), 1-5
April 1997, Geneva, Switzerland, Proceedings},
pages = {616--620},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/IPPS.1997.580965},
doi = {10.1109/IPPS.1997.580965},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/FerreiraKRU97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KenyonR96,
author = {Claire Kenyon and
Eric R{\'{e}}mila},
title = {Perfect matchings in the triangular lattice},
journal = {Discret. Math.},
volume = {152},
number = {1-3},
pages = {191--210},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(94)00304-2},
doi = {10.1016/0012-365X(94)00304-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KenyonR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/ChaboudK96,
author = {Thomas Chaboud and
Claire Kenyon},
title = {Planar Cayley Graphs with Regular Dual},
journal = {Int. J. Algebra Comput.},
volume = {6},
number = {5},
pages = {553--562},
year = {1996},
url = {https://doi.org/10.1142/S0218196796000301},
doi = {10.1142/S0218196796000301},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijac/ChaboudK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KenyonR96,
author = {Claire Kenyon and
Eric R{\'{e}}mila},
title = {Approximate Strip Packing},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {31--36},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548461},
doi = {10.1109/SFCS.1996.548461},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KenyonR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BrightwellKP96,
author = {Graham R. Brightwell and
Claire Kenyon and
H{\'{e}}l{\`{e}}ne Paugam{-}Moisy},
editor = {Michael Mozer and
Michael I. Jordan and
Thomas Petsche},
title = {Multilayer Neural Networks: One or Two Hidden Layers?},
booktitle = {Advances in Neural Information Processing Systems 9, NIPS, Denver,
CO, USA, December 2-5, 1996},
pages = {148--154},
publisher = {{MIT} Press},
year = {1996},
url = {http://papers.nips.cc/paper/1239-multilayer-neural-networks-one-or-two-hidden-layers},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/BrightwellKP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KenyonRS96,
author = {Claire Kenyon and
Yuval Rabani and
Alistair Sinclair},
editor = {{\'{E}}va Tardos},
title = {Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of
Best Fit Bin Packing (Preliminary Version)},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {351--358},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314082},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/KenyonRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Kenyon96,
author = {Claire Kenyon},
editor = {{\'{E}}va Tardos},
title = {Best-Fit Bin-Packing with Random Order},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {359--364},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314083},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Kenyon96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KarpKW96,
author = {Richard M. Karp and
Claire Kenyon and
Orli Waarts},
editor = {{\'{E}}va Tardos},
title = {Error-Resilient {DNA} Computation},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {458--467},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314103},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KarpKW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KenyonK94,
author = {Claire Kenyon and
Valerie King},
title = {On Boolean Decision Trees with Faulty Nodes},
journal = {Random Struct. Algorithms},
volume = {5},
number = {3},
pages = {453--464},
year = {1994},
url = {https://doi.org/10.1002/rsa.3240050306},
doi = {10.1002/RSA.3240050306},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KenyonK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AdlerGHKK94,
author = {Micah Adler and
Peter Gemmell and
Mor Harchol{-}Balter and
Richard M. Karp and
Claire Kenyon},
editor = {Daniel Dominic Sleator},
title = {Selection in the Presence of Noise: The Design of Playoff Systems},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {564--572},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314650},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/AdlerGHKK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spdp/DehneKF94,
author = {Frank Dehne and
Claire Kenyon and
Andreas Fabri},
title = {Scalable and architecture independent parallel geometric algorithms
with high probability optimal time},
booktitle = {Proceedings of the Sixth {IEEE} Symposium on Parallel and Distributed
Processing, {SPDP} 1994, Dallas, Texas, {USA} , October 26-29, 1994},
pages = {586--593},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SPDP.1994.346119},
doi = {10.1109/SPDP.1994.346119},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spdp/DehneKF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FraigniaudKP93,
author = {Pierre Fraigniaud and
Claire Kenyon and
Andrzej Pelc},
title = {Finding a Target Subnetwork in Sparse Networks with Random Faults},
journal = {Inf. Process. Lett.},
volume = {48},
number = {6},
pages = {297--303},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90172-6},
doi = {10.1016/0020-0190(93)90172-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FraigniaudKP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoddardKKS93,
author = {Wayne Goddard and
Claire Kenyon and
Valerie King and
Leonard J. Schulman},
title = {Optimal Randomized Algorithms for Local Sorting and Set-Maxima},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {2},
pages = {272--283},
year = {1993},
url = {https://doi.org/10.1137/0222020},
doi = {10.1137/0222020},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoddardKKS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KenyonRS93,
author = {Claire Kenyon and
Dana Randall and
Alistair Sinclair},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {Matchings in lattice graphs},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {738--746},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167278},
doi = {10.1145/167088.167278},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KenyonRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KenyonK92,
author = {Claire Kenyon and
Richard W. Kenyon},
title = {How to Take Short Cuts},
journal = {Discret. Comput. Geom.},
volume = {8},
pages = {251--264},
year = {1992},
url = {https://doi.org/10.1007/BF02293048},
doi = {10.1007/BF02293048},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/KenyonK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KenyonK92,
author = {Claire Kenyon and
Richard W. Kenyon},
title = {Tiling a Polygon with Rectangles},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {610--619},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267790},
doi = {10.1109/SFCS.1992.267790},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KenyonK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/KenyonK92,
author = {Claire Kenyon and
Valerie King},
editor = {Danny Dolev and
Zvi Galil and
Michael Rodeh},
title = {On Boolean Decision Trees with Faulty Nodes},
booktitle = {Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa,
Israel, May 1992},
series = {Lecture Notes in Computer Science},
volume = {601},
pages = {24--31},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0035163},
doi = {10.1007/BFB0035163},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/istcs/KenyonK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KenyonV91,
author = {Claire Kenyon{-}Mathieu and
Jeffrey Scott Vitter},
title = {Maximum Queue Size and Hashing with Lazy Deletion},
journal = {Algorithmica},
volume = {6},
number = {4},
pages = {597--619},
year = {1991},
url = {https://doi.org/10.1007/BF01759063},
doi = {10.1007/BF01759063},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KenyonV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kenyon-MathieuV91,
author = {Claire Kenyon{-}Mathieu and
Jeffrey Scott Vitter},
title = {The Maximum Size of Dynamic Data Structures},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {5},
pages = {807--823},
year = {1991},
url = {https://doi.org/10.1137/0220050},
doi = {10.1137/0220050},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Kenyon-MathieuV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KenyonK91,
author = {Claire Kenyon and
Richard W. Kenyon},
editor = {Robert L. Scot Drysdale},
title = {How to Take Short Cuts},
booktitle = {Proceedings of the Seventh Annual Symposium on Computational Geometry,
North Conway, NH, USA, , June 10-12, 1991},
pages = {250--255},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/109648.109676},
doi = {10.1145/109648.109676},
timestamp = {Mon, 14 Jun 2021 16:25:13 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/KenyonK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/LouchardKS91,
author = {Guy Louchard and
Claire Kenyon and
Ren{\'{e}} Schott},
editor = {Lothar Budach},
title = {Data Structures Maxima},
booktitle = {Fundamentals of Computation Theory, 8th International Symposium, {FCT}
'91, Gosen, Germany, September 9-13, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {529},
pages = {339--349},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54458-5\_78},
doi = {10.1007/3-540-54458-5\_78},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/LouchardKS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KenyonY90,
author = {Claire Kenyon and
Andrew Chi{-}Chih Yao},
title = {On Evaluating Boolean Functions with Unreliable Tests},
journal = {Int. J. Found. Comput. Sci.},
volume = {1},
number = {1},
pages = {1--10},
year = {1990},
url = {https://doi.org/10.1142/S0129054190000023},
doi = {10.1142/S0129054190000023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KenyonY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Kenyon-MathieuV89,
author = {Claire Kenyon{-}Mathieu and
Jeffrey Scott Vitter},
editor = {Giorgio Ausiello and
Mariangiola Dezani{-}Ciancaglini and
Simona Ronchi Della Rocca},
title = {General Methods for the Analysis of the Maximum Size of Dynamic Data
Structures (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 16th International Colloquium,
ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {372},
pages = {473--487},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0035778},
doi = {10.1007/BFB0035778},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Kenyon-MathieuV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kenyon-MathieuK89,
author = {Claire Kenyon{-}Mathieu and
Valerie King},
editor = {David S. Johnson},
title = {Verifying Partial Orders},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {367--374},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73042},
doi = {10.1145/73007.73042},
timestamp = {Wed, 24 Nov 2021 12:15:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kenyon-MathieuK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Mathieu87,
author = {Claire Mathieu},
title = {Some Problems in Computational Geometry},
journal = {Algorithmica},
volume = {2},
pages = {131--134},
year = {1987},
url = {https://doi.org/10.1007/BF01840354},
doi = {10.1007/BF01840354},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Mathieu87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MathieuPY87,
author = {Claire Mathieu and
Claude Puech and
Hossein Yahia},
title = {Average Efficiency of Data Structures for Binary Image Processing},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {89--93},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90043-3},
doi = {10.1016/0020-0190(87)90043-3},
timestamp = {Thu, 16 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MathieuPY87.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.
last updated on 2024-03-27 20:26 CET 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:
