Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ohad Trabelsi
@inproceedings{DBLP:conf/focs/BodwinHT23,
author = {Greg Bodwin and
Gary Hoppenworth and
Ohad Trabelsi},
title = {Bridge Girth: {A} Unifying Notion in Network Design},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {600--648},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00043},
doi = {10.1109/FOCS57990.2023.00043},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/BodwinHT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-04667,
author = {Ohad Trabelsi},
title = {(Almost) Ruling Out {SETH} Lower Bounds for All-Pairs Max-Flow},
journal = {CoRR},
volume = {abs/2304.04667},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.04667},
doi = {10.48550/ARXIV.2304.04667},
eprinttype = {arXiv},
eprint = {2304.04667},
timestamp = {Tue, 18 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-04667.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudK0PST22,
author = {Amir Abboud and
Robert Krauthgamer and
Jason Li and
Debmalya Panigrahi and
Thatchaphol Saranurak and
Ohad Trabelsi},
title = {Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree
in Nearly Quadratic Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {884--895},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00088},
doi = {10.1109/FOCS54457.2022.00088},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudK0PST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbboudKT22,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Friendly Cut Sparsifiers and Faster Gomory-Hu Trees},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {3630--3649},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.143},
doi = {10.1137/1.9781611977073.143},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbboudKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-11944,
author = {Greg Bodwin and
Gary Hoppenworth and
Ohad Trabelsi},
title = {Bridge Girth: {A} Unifying Notion in Network Design},
journal = {CoRR},
volume = {abs/2212.11944},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.11944},
doi = {10.48550/ARXIV.2212.11944},
eprinttype = {arXiv},
eprint = {2212.11944},
timestamp = {Wed, 04 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-11944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AbboudKT21,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
title = {New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected
Graphs},
journal = {Theory Comput.},
volume = {17},
pages = {1--27},
year = {2021},
url = {https://theoryofcomputing.org/articles/v017a005/},
timestamp = {Tue, 07 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/AbboudKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudKT21,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
title = {{APMF} {\textless} APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic
Time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1135--1146},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00112},
doi = {10.1109/FOCS52979.2021.00112},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AbboudKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudKT21,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Subcubic algorithms for Gomory-Hu tree in unweighted graphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1725--1737},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451073},
doi = {10.1145/3406325.3451073},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbboudKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-02981,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
title = {{APMF} {\textless} APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic
Time},
journal = {CoRR},
volume = {abs/2106.02981},
year = {2021},
url = {https://arxiv.org/abs/2106.02981},
eprinttype = {arXiv},
eprint = {2106.02981},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-02981.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-15891,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
title = {Friendly Cut Sparsifiers and Faster Gomory-Hu Trees},
journal = {CoRR},
volume = {abs/2110.15891},
year = {2021},
url = {https://arxiv.org/abs/2110.15891},
eprinttype = {arXiv},
eprint = {2110.15891},
timestamp = {Tue, 02 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-15891.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-04958,
author = {Amir Abboud and
Robert Krauthgamer and
Jason Li and
Debmalya Panigrahi and
Thatchaphol Saranurak and
Ohad Trabelsi},
title = {Gomory-Hu Tree in Subcubic Time},
journal = {CoRR},
volume = {abs/2111.04958},
year = {2021},
url = {https://arxiv.org/abs/2111.04958},
eprinttype = {arXiv},
eprint = {2111.04958},
timestamp = {Tue, 08 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-04958.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudKT20,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
editor = {Sandy Irani},
title = {Cut-Equivalent Trees are Optimal for Min-Cut Queries},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {105--118},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00019},
doi = {10.1109/FOCS46700.2020.00019},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AbboudKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbboudKT20,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
editor = {Shuchi Chawla},
title = {New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected
Graphs},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {48--61},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.4},
doi = {10.1137/1.9781611975994.4},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/AbboudKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-06090,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
title = {Cut-Equivalent Trees are Optimal for Min-Cut Queries},
journal = {CoRR},
volume = {abs/2009.06090},
year = {2020},
url = {https://arxiv.org/abs/2009.06090},
eprinttype = {arXiv},
eprint = {2009.06090},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-06090.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-10281,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
title = {Subcubic Algorithms for Gomory-Hu Tree in Unweighted Graphs},
journal = {CoRR},
volume = {abs/2012.10281},
year = {2020},
url = {https://arxiv.org/abs/2012.10281},
eprinttype = {arXiv},
eprint = {2012.10281},
timestamp = {Mon, 04 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-10281.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbboudGIKPTUW19,
author = {Amir Abboud and
Loukas Georgiadis and
Giuseppe F. Italiano and
Robert Krauthgamer and
Nikos Parotsidis and
Ohad Trabelsi and
Przemyslaw Uznanski and
Daniel Wolleb{-}Graf},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Faster Algorithms for All-Pairs Bounded Min-Cuts},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {7:1--7:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.7},
doi = {10.4230/LIPICS.ICALP.2019.7},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AbboudGIKPTUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FiltserKT19,
author = {Arnold Filtser and
Robert Krauthgamer and
Ohad Trabelsi},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Relaxed Voronoi: {A} Simple Framework for Terminal-Clustering Problems},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {10:1--10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.10},
doi = {10.4230/OASICS.SOSA.2019.10},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/FiltserKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KrauthgamerT19,
author = {Robert Krauthgamer and
Ohad Trabelsi},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {45:1--45:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.45},
doi = {10.4230/LIPICS.STACS.2019.45},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KrauthgamerT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-01412,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
title = {New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected
Graphs},
journal = {CoRR},
volume = {abs/1901.01412},
year = {2019},
url = {http://arxiv.org/abs/1901.01412},
eprinttype = {arXiv},
eprint = {1901.01412},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-01412.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CarmiCT18,
author = {Paz Carmi and
Lilach Chaitman{-}Yerushalmi and
Ohad Trabelsi},
title = {Bounded-Hop Communication Networks},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3050--3077},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0370-9},
doi = {10.1007/S00453-017-0370-9},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CarmiCT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KrauthgamerT18,
author = {Robert Krauthgamer and
Ohad Trabelsi},
title = {Conditional Lower Bounds for All-Pairs Max-Flow},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {4},
pages = {42:1--42:15},
year = {2018},
url = {https://doi.org/10.1145/3212510},
doi = {10.1145/3212510},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KrauthgamerT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-04940,
author = {Lior Kamma and
Ohad Trabelsi},
title = {Nearly Optimal Time Bounds for kPath in Hypergraphs},
journal = {CoRR},
volume = {abs/1803.04940},
year = {2018},
url = {http://arxiv.org/abs/1803.04940},
eprinttype = {arXiv},
eprint = {1803.04940},
timestamp = {Wed, 20 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-04940.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05803,
author = {Amir Abboud and
Loukas Georgiadis and
Daniel Graf and
Giuseppe F. Italiano and
Robert Krauthgamer and
Nikos Parotsidis and
Ohad Trabelsi and
Przemyslaw Uznanski},
title = {Faster Algorithms for All-Pairs Bounded Min-Cuts},
journal = {CoRR},
volume = {abs/1807.05803},
year = {2018},
url = {http://arxiv.org/abs/1807.05803},
eprinttype = {arXiv},
eprint = {1807.05803},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05803.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-00942,
author = {Arnold Filtser and
Robert Krauthgamer and
Ohad Trabelsi},
title = {Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems},
journal = {CoRR},
volume = {abs/1809.00942},
year = {2018},
url = {http://arxiv.org/abs/1809.00942},
eprinttype = {arXiv},
eprint = {1809.00942},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-00942.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KrauthgamerT17,
author = {Robert Krauthgamer and
Ohad Trabelsi},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Conditional Lower Bounds for All-Pairs Max-Flow},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {20:1--20:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.20},
doi = {10.4230/LIPICS.ICALP.2017.20},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KrauthgamerT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KrauthgamerT17,
author = {Robert Krauthgamer and
Ohad Trabelsi},
title = {Conditional Lower Bounds for All-Pairs Max-Flow},
journal = {CoRR},
volume = {abs/1702.05805},
year = {2017},
url = {http://arxiv.org/abs/1702.05805},
eprinttype = {arXiv},
eprint = {1702.05805},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KrauthgamerT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-07591,
author = {Robert Krauthgamer and
Ohad Trabelsi},
title = {Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern},
journal = {CoRR},
volume = {abs/1708.07591},
year = {2017},
url = {http://arxiv.org/abs/1708.07591},
eprinttype = {arXiv},
eprint = {1708.07591},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-07591.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-08041,
author = {Robert Krauthgamer and
Ohad Trabelsi},
title = {Revisiting the Set Cover Conjecture},
journal = {CoRR},
volume = {abs/1711.08041},
year = {2017},
url = {http://arxiv.org/abs/1711.08041},
eprinttype = {arXiv},
eprint = {1711.08041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-08041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CarmiCT15,
author = {Paz Carmi and
Lilach Chaitman{-}Yerushalmi and
Ohad Trabelsi},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {On the Bounded-Hop Range Assignment Problem},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {140--151},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_12},
doi = {10.1007/978-3-319-21840-3\_12},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/CarmiCT15.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-04-25 01:13 CEST 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:
