Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Pawel Gawrychowski
@inproceedings{DBLP:conf/latin/AdamsonGM24,
author = {Duncan Adamson and
Pawel Gawrychowski and
Florin Manea},
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {Enumerating m-Length Walks in Directed Graphs with Constant Delay},
booktitle = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14578},
pages = {35--50},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55598-5\_3},
doi = {10.1007/978-3-031-55598-5\_3},
timestamp = {Wed, 13 Mar 2024 19:10:54 +0100},
biburl = {https://dblp.org/rec/conf/latin/AdamsonGM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DudekGS24,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Tatiana Starikovskaya},
editor = {Merav Parter and
Seth Pettie},
title = {Sorting Signed Permutations by Reversals in Nearly-Linear Time},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {199--214},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.19},
doi = {10.1137/1.9781611977936.19},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/DudekGS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-02163,
author = {Duncan Adamson and
Pawel Gawrychowski and
Florin Manea},
title = {Enumerating m-Length Walks in Directed Graphs with Constant Delay},
journal = {CoRR},
volume = {abs/2401.02163},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.02163},
doi = {10.48550/ARXIV.2401.02163},
eprinttype = {arXiv},
eprint = {2401.02163},
timestamp = {Tue, 23 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-02163.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-06667,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Samah Ghazawi},
title = {Optimal Bounds for Distinct Quartics},
journal = {CoRR},
volume = {abs/2403.06667},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.06667},
doi = {10.48550/ARXIV.2403.06667},
eprinttype = {arXiv},
eprint = {2403.06667},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-06667.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GawrychowskiU23,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
title = {Better Distance Labeling for Unweighted Planar Graphs},
journal = {Algorithmica},
volume = {85},
number = {6},
pages = {1805--1823},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01133-z},
doi = {10.1007/S00453-023-01133-Z},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GawrychowskiU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GawrychowskiKRW23,
author = {Pawel Gawrychowski and
Tomasz Kociumaka and
Wojciech Rytter and
Tomasz Walen},
title = {Tight Bound for the Number of Distinct Palindromes in a Tree},
journal = {Electron. J. Comb.},
volume = {30},
number = {2},
year = {2023},
url = {https://doi.org/10.37236/10842},
doi = {10.37236/10842},
timestamp = {Thu, 18 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GawrychowskiKRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CharalampopoulosGLMPWW23,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Yaowei Long and
Shay Mozes and
Seth Pettie and
Oren Weimann and
Christian Wulff{-}Nilsen},
title = {Almost Optimal Exact Distance Oracles for Planar Graphs},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {12:1--12:50},
year = {2023},
url = {https://doi.org/10.1145/3580474},
doi = {10.1145/3580474},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CharalampopoulosGLMPWW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Charalampopoulos23,
author = {Panagiotis Charalampopoulos and
Bartlomiej Dudek and
Pawel Gawrychowski and
Karol Pokorski},
editor = {Laurent Bulteau and
Zsuzsanna Lipt{\'{a}}k},
title = {Optimal Near-Linear Space Heaviest Induced Ancestors},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023,
June 26-28, 2023, Marne-la-Vall{\'{e}}e, France},
series = {LIPIcs},
volume = {259},
pages = {8:1--8:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CPM.2023.8},
doi = {10.4230/LIPICS.CPM.2023.8},
timestamp = {Wed, 21 Jun 2023 16:06:33 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Charalampopoulos23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiGSS23,
author = {Pawel Gawrychowski and
Garance Gourdel and
Tatiana Starikovskaya and
Teresa Anna Steiner},
editor = {Laurent Bulteau and
Zsuzsanna Lipt{\'{a}}k},
title = {Compressed Indexing for Consecutive Occurrences},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023,
June 26-28, 2023, Marne-la-Vall{\'{e}}e, France},
series = {LIPIcs},
volume = {259},
pages = {12:1--12:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CPM.2023.12},
doi = {10.4230/LIPICS.CPM.2023.12},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiGSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiGL23,
author = {Pawel Gawrychowski and
Samah Ghazawi and
Gad M. Landau},
editor = {Laurent Bulteau and
Zsuzsanna Lipt{\'{a}}k},
title = {Order-Preserving Squares in Strings},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023,
June 26-28, 2023, Marne-la-Vall{\'{e}}e, France},
series = {LIPIcs},
volume = {259},
pages = {13:1--13:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CPM.2023.13},
doi = {10.4230/LIPICS.CPM.2023.13},
timestamp = {Wed, 21 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiGL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0001FGP23,
author = {Giulia Bernardini and
Gabriele Fici and
Pawel Gawrychowski and
Solon P. Pissis},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {Substring Complexity in Sublinear Space},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {12:1--12:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.12},
doi = {10.4230/LIPICS.ISAAC.2023.12},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/0001FGP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EllertGG23,
author = {Jonas Ellert and
Pawel Gawrychowski and
Garance Gourdel},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Optimal Square Detection Over General Alphabets},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {5220--5242},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch189},
doi = {10.1137/1.9781611977554.CH189},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/EllertGG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/GawrychowskiKM23,
author = {Pawel Gawrychowski and
Maria Kosche and
Florin Manea},
editor = {Franco Maria Nardini and
Nadia Pisanti and
Rossano Venturini},
title = {On the Number of Factors in the LZ-End Factorization},
booktitle = {String Processing and Information Retrieval - 30th International Symposium,
{SPIRE} 2023, Pisa, Italy, September 26-28, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14240},
pages = {253--259},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43980-3\_20},
doi = {10.1007/978-3-031-43980-3\_20},
timestamp = {Sun, 24 Sep 2023 14:26:25 +0200},
biburl = {https://dblp.org/rec/conf/spire/GawrychowskiKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-00724,
author = {Pawel Gawrychowski and
Samah Ghazawi and
Gad M. Landau},
title = {Order-Preserving Squares in Strings},
journal = {CoRR},
volume = {abs/2302.00724},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.00724},
doi = {10.48550/ARXIV.2302.00724},
eprinttype = {arXiv},
eprint = {2302.00724},
timestamp = {Thu, 09 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-00724.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-01373,
author = {Panagiotis Charalampopoulos and
Bartlomiej Dudek and
Pawel Gawrychowski and
Karol Pokorski},
title = {Optimal Heaviest Induced Ancestors},
journal = {CoRR},
volume = {abs/2302.01373},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.01373},
doi = {10.48550/ARXIV.2302.01373},
eprinttype = {arXiv},
eprint = {2302.01373},
timestamp = {Thu, 09 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-01373.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-07229,
author = {Jonas Ellert and
Pawel Gawrychowski and
Garance Gourdel},
title = {Optimal Square Detection Over General Alphabets},
journal = {CoRR},
volume = {abs/2303.07229},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.07229},
doi = {10.48550/ARXIV.2303.07229},
eprinttype = {arXiv},
eprint = {2303.07229},
timestamp = {Thu, 16 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-07229.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-00887,
author = {Pawel Gawrychowski and
Garance Gourdel and
Tatiana Starikovskaya and
Teresa Anna Steiner},
title = {Compressed Indexing for Consecutive Occurrences},
journal = {CoRR},
volume = {abs/2304.00887},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.00887},
doi = {10.48550/ARXIV.2304.00887},
eprinttype = {arXiv},
eprint = {2304.00887},
timestamp = {Mon, 17 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-00887.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-15928,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Sorting Signed Permutations by Reversals in Nearly-Linear Time},
journal = {CoRR},
volume = {abs/2308.15928},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.15928},
doi = {10.48550/ARXIV.2308.15928},
eprinttype = {arXiv},
eprint = {2308.15928},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-15928.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GawrychowskiS22,
author = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Streaming Dictionary Matching with Mismatches},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {896--916},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00876-x},
doi = {10.1007/S00453-021-00876-X},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GawrychowskiS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GawrychowskiMS22,
author = {Pawel Gawrychowski and
Florin Manea and
Radoslaw Serafin},
title = {Fast and Longest Rollercoasters},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1081--1106},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00908-6},
doi = {10.1007/S00453-021-00908-6},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GawrychowskiMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/ColcombetFGO22,
author = {Thomas Colcombet and
Nathana{\"{e}}l Fijalkow and
Pawel Gawrychowski and
Pierre Ohlmann},
title = {The Theory of Universal Graphs for Infinite Duration Games},
journal = {Log. Methods Comput. Sci.},
volume = {18},
number = {3},
year = {2022},
url = {https://doi.org/10.46298/lmcs-18(3:29)2022},
doi = {10.46298/LMCS-18(3:29)2022},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/ColcombetFGO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BernardiniGPPR22,
author = {Giulia Bernardini and
Pawel Gawrychowski and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
title = {Elastic-Degenerate String Matching via Fast Matrix Multiplication},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {3},
pages = {549--576},
year = {2022},
url = {https://doi.org/10.1137/20m1368033},
doi = {10.1137/20M1368033},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BernardiniGPPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-NatanCGMW22,
author = {Aviv Bar{-}Natan and
Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Fault-tolerant distance labeling for planar graphs},
journal = {Theor. Comput. Sci.},
volume = {918},
pages = {48--59},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.03.020},
doi = {10.1016/J.TCS.2022.03.020},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Bar-NatanCGMW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ApersGL22,
author = {Simon Apers and
Pawel Gawrychowski and
Troy Lee},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Finding the {KT} Partition of a Weighted Graph in Near-Linear Time},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {32:1--32:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.32},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.32},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ApersGL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CliffordGK0U22,
author = {Rapha{\"{e}}l Clifford and
Pawel Gawrychowski and
Tomasz Kociumaka and
Daniel P. Martin and
Przemyslaw Uznanski},
editor = {Hideo Bannai and
Jan Holub},
title = {The Dynamic k-Mismatch Problem},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022,
June 27-29, 2022, Prague, Czech Republic},
series = {LIPIcs},
volume = {223},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CPM.2022.18},
doi = {10.4230/LIPICS.CPM.2022.18},
timestamp = {Wed, 22 Jun 2022 16:20:49 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CliffordGK0U22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApersEGLMN22,
author = {Simon Apers and
Yuval Efron and
Pawel Gawrychowski and
Troy Lee and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Cut Query Algorithms with Star Contraction},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {507--518},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00055},
doi = {10.1109/FOCS54457.2022.00055},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ApersEGLMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiP22,
author = {Pawel Gawrychowski and
Karol Pokorski},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Sublinear Dynamic Interval Scheduling (On One or Multiple Machines)},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {67:1--67:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.67},
doi = {10.4230/LIPICS.ICALP.2022.67},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DudekGGS22,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Garance Gourdel and
Tatiana Starikovskaya},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Streaming Regular Expression Membership and Pattern Matching},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {670--694},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.30},
doi = {10.1137/1.9781611977073.30},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DudekGGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GanardiG22,
author = {Moses Ganardi and
Pawel Gawrychowski},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Pattern Matching on Grammar-Compressed Strings in Linear Time},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {2833--2846},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.110},
doi = {10.1137/1.9781611977073.110},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GanardiG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GawrychowskiJ22,
author = {Pawel Gawrychowski and
Wojciech Janczewski},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Simpler Adjacency Labeling for Planar Graphs with B-Trees},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {24--36},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.3},
doi = {10.1137/1.9781611977066.3},
timestamp = {Sat, 19 Aug 2023 18:10:48 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GawrychowskiJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GawrychowskiR22,
author = {Pawel Gawrychowski and
Mateusz Rzepecki},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Faster Exponential Algorithm for Permutation Pattern Matching},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {279--284},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.21},
doi = {10.1137/1.9781611977066.21},
timestamp = {Mon, 11 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GawrychowskiR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/GawrychowskiMS22,
author = {Pawel Gawrychowski and
Florin Manea and
Stefan Siemer},
editor = {Diego Arroyuelo and
Barbara Poblete},
title = {Matching Patterns with Variables Under Edit Distance},
booktitle = {String Processing and Information Retrieval - 29th International Symposium,
{SPIRE} 2022, Concepci{\'{o}}n, Chile, November 8-10, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13617},
pages = {275--289},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20643-6\_20},
doi = {10.1007/978-3-031-20643-6\_20},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/GawrychowskiMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/Charalampopoulos22a,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Diego Arroyuelo and
Barbara Poblete},
title = {On the Hardness of Computing the Edit Distance of Shallow Trees},
booktitle = {String Processing and Information Retrieval - 29th International Symposium,
{SPIRE} 2022, Concepci{\'{o}}n, Chile, November 8-10, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13617},
pages = {290--302},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20643-6\_21},
doi = {10.1007/978-3-031-20643-6\_21},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/Charalampopoulos22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05674,
author = {Simon Apers and
Yuval Efron and
Pawel Gawrychowski and
Troy Lee and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Cut query algorithms with star contraction},
journal = {CoRR},
volume = {abs/2201.05674},
year = {2022},
url = {https://arxiv.org/abs/2201.05674},
eprinttype = {arXiv},
eprint = {2201.05674},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05674.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-14310,
author = {Pawel Gawrychowski and
Karol Pokorski},
title = {Sublinear Dynamic Interval Scheduling (on one or multiple machines)},
journal = {CoRR},
volume = {abs/2203.14310},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.14310},
doi = {10.48550/ARXIV.2203.14310},
eprinttype = {arXiv},
eprint = {2203.14310},
timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-14310.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-07477,
author = {Pawel Gawrychowski and
Florin Manea and
Stefan Siemer},
title = {Matching Patterns with Variables Under Edit Distance},
journal = {CoRR},
volume = {abs/2207.07477},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.07477},
doi = {10.48550/ARXIV.2207.07477},
eprinttype = {arXiv},
eprint = {2207.07477},
timestamp = {Tue, 19 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-07477.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BilleGGLW21,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
title = {Top Tree Compression of Tries},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3602--3628},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00869-w},
doi = {10.1007/S00453-021-00869-W},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BilleGGLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BelazzouguiCGGK21,
author = {Djamal Belazzougui and
Manuel C{\'{a}}ceres and
Travis Gagie and
Pawel Gawrychowski and
Juha K{\"{a}}rkk{\"{a}}inen and
Gonzalo Navarro and
Alberto Ord{\'{o}}{\~{n}}ez Pereira and
Simon J. Puglisi and
Yasuo Tabei},
title = {Block trees},
journal = {J. Comput. Syst. Sci.},
volume = {117},
pages = {1--22},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2020.11.002},
doi = {10.1016/J.JCSS.2020.11.002},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BelazzouguiCGGK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GawrychowskiKMS21,
author = {Pawel Gawrychowski and
Haim Kaplan and
Shay Mozes and
Micha Sharir and
Oren Weimann},
title = {Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic
{\~{O}}(n\({}^{\mbox{5/3}}\)) Time},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {2},
pages = {509--554},
year = {2021},
url = {https://doi.org/10.1137/18M1193402},
doi = {10.1137/18M1193402},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GawrychowskiKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BadkobehGKPZ21,
author = {Golnaz Badkobeh and
Pawel Gawrychowski and
Juha K{\"{a}}rkk{\"{a}}inen and
Simon J. Puglisi and
Bella Zhukova},
title = {Tight upper and lower bounds on suffix tree breadth},
journal = {Theor. Comput. Sci.},
volume = {854},
pages = {63--67},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.11.037},
doi = {10.1016/J.TCS.2020.11.037},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BadkobehGKPZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Charalampopoulos21,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {An Almost Optimal Edit Distance Oracle},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {48:1--48:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.48},
doi = {10.4230/LIPICS.ICALP.2021.48},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Charalampopoulos21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GawrychowskiMS21,
author = {Pawel Gawrychowski and
Florin Manea and
Stefan Siemer},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Matching Patterns with Variables Under Hamming Distance},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {48:1--48:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.48},
doi = {10.4230/LIPICS.MFCS.2021.48},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GawrychowskiMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Bar-NatanCGMW21,
author = {Aviv Bar{-}Natan and
Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Tomasz Jurdzinski and
Stefan Schmid},
title = {Fault-Tolerant Distance Labeling for Planar Graphs},
booktitle = {Structural Information and Communication Complexity - 28th International
Colloquium, {SIROCCO} 2021, Wroc{\l}aw, Poland, June 28 - July 1,
2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12810},
pages = {315--333},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79527-6\_18},
doi = {10.1007/978-3-030-79527-6\_18},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/Bar-NatanCGMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiJL21,
author = {Pawel Gawrychowski and
Wojciech Janczewski and
Jakub Lopuszanski},
editor = {D{\'{a}}niel Marx},
title = {Shorter Labels for Routing in Trees},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2174--2193},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.130},
doi = {10.1137/1.9781611976465.130},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiJL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiMW21,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {D{\'{a}}niel Marx},
title = {Planar Negative \emph{k}-Cycle},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2717--2724},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.161},
doi = {10.1137/1.9781611976465.161},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GawrychowskiMW21,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Hung Viet Le and
Valerie King},
title = {A Note on a Recent Algorithm for Minimum Cut},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {74--79},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.8},
doi = {10.1137/1.9781611976496.8},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GawrychowskiMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/GawrychowskiGL21,
author = {Pawel Gawrychowski and
Samah Ghazawi and
Gad M. Landau},
editor = {Thierry Lecroq and
H{\'{e}}l{\`{e}}ne Touzet},
title = {Lower Bounds for the Number of Repetitions in 2D Strings},
booktitle = {String Processing and Information Retrieval - 28th International Symposium,
{SPIRE} 2021, Lille, France, October 4-6, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12944},
pages = {179--192},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86692-1\_15},
doi = {10.1007/978-3-030-86692-1\_15},
timestamp = {Tue, 28 Sep 2021 13:29:19 +0200},
biburl = {https://dblp.org/rec/conf/spire/GawrychowskiGL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GawrychowskiKKM21,
author = {Pawel Gawrychowski and
Maria Kosche and
Tore Ko{\ss} and
Florin Manea and
Stefan Siemer},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {Efficiently Testing Simon's Congruence},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {34:1--34:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.34},
doi = {10.4230/LIPICS.STACS.2021.34},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GawrychowskiKKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GawrychowskiJ21,
author = {Pawel Gawrychowski and
Wojciech Janczewski},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Fully dynamic approximation of {LIS} in polylogarithmic time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {654--667},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451137},
doi = {10.1145/3406325.3451137},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GawrychowskiJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BernardiniBG21,
author = {Giulia Bernardini and
Paola Bonizzoni and
Pawel Gawrychowski},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Incomplete Directed Perfect Phylogeny in Linear Time},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {172--185},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_13},
doi = {10.1007/978-3-030-83508-8\_13},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BernardiniBG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DudekGP21,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Karol Pokorski},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Strictly In-Place Algorithms for Permuting and Inverting Permutations},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {329--342},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_24},
doi = {10.1007/978-3-030-83508-8\_24},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/DudekGP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GawrychowskiU21,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Better Distance Labeling for Unweighted Planar Graphs},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {428--441},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_31},
doi = {10.1007/978-3-030-83508-8\_31},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/GawrychowskiU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2021,
editor = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {32nd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2021,
July 5-7, 2021, Wroc{\l}aw, Poland},
series = {LIPIcs},
volume = {191},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-186-3},
isbn = {978-3-95977-186-3},
timestamp = {Mon, 05 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-03978,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Karol Pokorski},
title = {Strictly In-Place Algorithms for Permuting and Inverting Permutations},
journal = {CoRR},
volume = {abs/2101.03978},
year = {2021},
url = {https://arxiv.org/abs/2101.03978},
eprinttype = {arXiv},
eprint = {2101.03978},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-03978.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-07154,
author = {Aviv Bar{-}Natan and
Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Fault-Tolerant Distance Labeling for Planar Graphs},
journal = {CoRR},
volume = {abs/2102.07154},
year = {2021},
url = {https://arxiv.org/abs/2102.07154},
eprinttype = {arXiv},
eprint = {2102.07154},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-07154.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-11797,
author = {Pawel Gawrychowski and
Wojciech Janczewski},
title = {Conditional Lower Bounds for Variants of Dynamic {LIS}},
journal = {CoRR},
volume = {abs/2102.11797},
year = {2021},
url = {https://arxiv.org/abs/2102.11797},
eprinttype = {arXiv},
eprint = {2102.11797},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-11797.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-03294,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {An Almost Optimal Edit Distance Oracle},
journal = {CoRR},
volume = {abs/2103.03294},
year = {2021},
url = {https://arxiv.org/abs/2103.03294},
eprinttype = {arXiv},
eprint = {2103.03294},
timestamp = {Mon, 15 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-03294.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-05262,
author = {Thomas Colcombet and
Nathana{\"{e}}l Fijalkow and
Pawel Gawrychowski and
Pierre Ohlmann},
title = {The Theory of Universal Graphs for Infinite Duration Games},
journal = {CoRR},
volume = {abs/2104.05262},
year = {2021},
url = {https://arxiv.org/abs/2104.05262},
eprinttype = {arXiv},
eprint = {2104.05262},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-05262.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-06166,
author = {Rapha{\"{e}}l Clifford and
Pawel Gawrychowski and
Tomasz Kociumaka and
Daniel P. Martin and
Przemyslaw Uznanski},
title = {The Dynamic k-Mismatch Problem},
journal = {CoRR},
volume = {abs/2105.06166},
year = {2021},
url = {https://arxiv.org/abs/2105.06166},
eprinttype = {arXiv},
eprint = {2105.06166},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-06166.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-14903,
author = {Pawel Gawrychowski and
Samah Ghazawi and
Gad M. Landau},
title = {Lower Bounds for the Number of Repetitions in 2D Strings},
journal = {CoRR},
volume = {abs/2105.14903},
year = {2021},
url = {https://arxiv.org/abs/2105.14903},
eprinttype = {arXiv},
eprint = {2105.14903},
timestamp = {Wed, 02 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-14903.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-06249,
author = {Pawel Gawrychowski and
Florin Manea and
Stefan Siemer},
title = {Matching Patterns with Variables under Hamming Distance},
journal = {CoRR},
volume = {abs/2106.06249},
year = {2021},
url = {https://arxiv.org/abs/2106.06249},
eprinttype = {arXiv},
eprint = {2106.06249},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-06249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-11475,
author = {Pawel Gawrychowski and
Mateusz Rzepecki},
title = {Faster Exponential Algorithm for Permutation Pattern Matching},
journal = {CoRR},
volume = {abs/2108.11475},
year = {2021},
url = {https://arxiv.org/abs/2108.11475},
eprinttype = {arXiv},
eprint = {2108.11475},
timestamp = {Fri, 27 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-11475.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-01378,
author = {Simon Apers and
Pawel Gawrychowski and
Troy Lee},
title = {Finding the {KT} partition of a weighted graph in near-linear time},
journal = {CoRR},
volume = {abs/2111.01378},
year = {2021},
url = {https://arxiv.org/abs/2111.01378},
eprinttype = {arXiv},
eprint = {2111.01378},
timestamp = {Fri, 05 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-01378.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-05016,
author = {Moses Ganardi and
Pawel Gawrychowski},
title = {Pattern Matching on Grammar-Compressed Strings in Linear Time},
journal = {CoRR},
volume = {abs/2111.05016},
year = {2021},
url = {https://arxiv.org/abs/2111.05016},
eprinttype = {arXiv},
eprint = {2111.05016},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-05016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GawrychowskiMW20,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Submatrix Maximum Queries in Monge and Partial Monge Matrices Are
Equivalent to Predecessor Search},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {2},
pages = {16:1--16:24},
year = {2020},
url = {https://doi.org/10.1145/3381416},
doi = {10.1145/3381416},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GawrychowskiMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BringmannGMW20,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless
{APSP} Can)},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {4},
pages = {48:1--48:22},
year = {2020},
url = {https://doi.org/10.1145/3381878},
doi = {10.1145/3381878},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BringmannGMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GawrychowskiJMW20,
author = {Pawel Gawrychowski and
Seungbum Jo and
Shay Mozes and
Oren Weimann},
title = {Compressed range minimum queries},
journal = {Theor. Comput. Sci.},
volume = {812},
pages = {39--48},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.07.002},
doi = {10.1016/J.TCS.2019.07.002},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GawrychowskiJMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GawrychowskiKRR20,
author = {Pawel Gawrychowski and
Tomasz Kociumaka and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
title = {Universal reconstruction of a string},
journal = {Theor. Comput. Sci.},
volume = {812},
pages = {174--186},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.10.027},
doi = {10.1016/J.TCS.2019.10.027},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GawrychowskiKRR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/0001BG20,
author = {Giulia Bernardini and
Paola Bonizzoni and
Pawel Gawrychowski},
editor = {Inge Li G{\o}rtz and
Oren Weimann},
title = {On Two Measures of Distance Between Fully-Labelled Trees},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020,
June 17-19, 2020, Copenhagen, Denmark},
series = {LIPIcs},
volume = {161},
pages = {6:1--6:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CPM.2020.6},
doi = {10.4230/LIPICS.CPM.2020.6},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/0001BG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiGL20,
author = {Pawel Gawrychowski and
Samah Ghazawi and
Gad M. Landau},
editor = {Inge Li G{\o}rtz and
Oren Weimann},
title = {On Indeterminate Strings Matching},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020,
June 17-19, 2020, Copenhagen, Denmark},
series = {LIPIcs},
volume = {161},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CPM.2020.14},
doi = {10.4230/LIPICS.CPM.2020.14},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiGL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Charalampopoulos20,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Karol Pokorski},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Dynamic Longest Common Substring in Polylogarithmic Time},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {27:1--27:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.27},
doi = {10.4230/LIPICS.ICALP.2020.27},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Charalampopoulos20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiMW20,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Minimum Cut in O(m log{\({^2}\)} n) Time},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {57:1--57:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.57},
doi = {10.4230/LIPICS.ICALP.2020.57},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AgrawalG20,
author = {Anadi Agrawal and
Pawel Gawrychowski},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {A Faster Subquadratic Algorithm for the Longest Common Increasing
Subsequence Problem},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {4:1--4:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.4},
doi = {10.4230/LIPICS.ISAAC.2020.4},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AgrawalG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0001G20,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles
in Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {23:1--23:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.23},
doi = {10.4230/LIPICS.ISAAC.2020.23},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/0001G20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DulebaGJ20,
author = {Maciej Duleba and
Pawel Gawrychowski and
Wojciech Janczewski},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Efficient Labeling for Reachability in Directed Acyclic Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.27},
doi = {10.4230/LIPICS.ISAAC.2020.27},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DulebaGJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FijalkowGO20,
author = {Nathana{\"{e}}l Fijalkow and
Pawel Gawrychowski and
Pierre Ohlmann},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Value Iteration Using Universal Graphs and the Complexity of Mean
Payoff Games},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {34:1--34:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.34},
doi = {10.4230/LIPICS.MFCS.2020.34},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/FijalkowGO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GawrychowskiLRS20,
author = {Pawel Gawrychowski and
Martin Lange and
Narad Rampersad and
Jeffrey O. Shallit and
Marek Szykula},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Existential Length Universality},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.16},
doi = {10.4230/LIPICS.STACS.2020.16},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GawrychowskiLRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/0001GS20,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Tatiana Starikovskaya},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Generalised Pattern Matching Revisited},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {18:1--18:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.18},
doi = {10.4230/LIPICS.STACS.2020.18},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/0001GS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001GS20,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Tatiana Starikovskaya},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {All non-trivial variants of 3-LDT are equivalent},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {974--981},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384275},
doi = {10.1145/3357713.3384275},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0001GS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-01289,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {All non-trivial variants of 3-LDT are equivalent},
journal = {CoRR},
volume = {abs/2001.01289},
year = {2020},
url = {http://arxiv.org/abs/2001.01289},
eprinttype = {arXiv},
eprint = {2001.01289},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-01289.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-05976,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Generalised Pattern Matching Revisited},
journal = {CoRR},
volume = {abs/2001.05976},
year = {2020},
url = {https://arxiv.org/abs/2001.05976},
eprinttype = {arXiv},
eprint = {2001.05976},
timestamp = {Fri, 17 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-05976.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-05600,
author = {Giulia Bernardini and
Paola Bonizzoni and
Pawel Gawrychowski},
title = {On Two Measures of Distance between Fully-Labelled Trees},
journal = {CoRR},
volume = {abs/2002.05600},
year = {2020},
url = {https://arxiv.org/abs/2002.05600},
eprinttype = {arXiv},
eprint = {2002.05600},
timestamp = {Fri, 14 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-05600.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-06691,
author = {Pawel Gawrychowski and
Wojciech Janczewski and
Jakub Lopuszanski},
title = {Shorter Labels for Routing in Trees},
journal = {CoRR},
volume = {abs/2003.06691},
year = {2020},
url = {https://arxiv.org/abs/2003.06691},
eprinttype = {arXiv},
eprint = {2003.06691},
timestamp = {Tue, 17 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-06691.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-13589,
author = {Anadi Agrawal and
Pawel Gawrychowski},
title = {A Faster Subquadratic Algorithm for the Longest Common Increasing
Subsequence Problem},
journal = {CoRR},
volume = {abs/2003.13589},
year = {2020},
url = {https://arxiv.org/abs/2003.13589},
eprinttype = {arXiv},
eprint = {2003.13589},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-13589.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-01112,
author = {Pawel Gawrychowski and
Maria Kosche and
Tore Koss and
Florin Manea and
Stefan Siemer},
title = {Efficiently Testing Simon's Congruence},
journal = {CoRR},
volume = {abs/2005.01112},
year = {2020},
url = {https://arxiv.org/abs/2005.01112},
eprinttype = {arXiv},
eprint = {2005.01112},
timestamp = {Fri, 08 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-01112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-02408,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Karol Pokorski},
title = {Dynamic Longest Common Substring in Polylogarithmic Time},
journal = {CoRR},
volume = {abs/2006.02408},
year = {2020},
url = {https://arxiv.org/abs/2006.02408},
eprinttype = {arXiv},
eprint = {2006.02408},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-02408.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-06105,
author = {Maciej Duleba and
Pawel Gawrychowski and
Wojciech Janczewski},
title = {Efficient Labeling for Reachability in Digraphs},
journal = {CoRR},
volume = {abs/2007.06105},
year = {2020},
url = {https://arxiv.org/abs/2007.06105},
eprinttype = {arXiv},
eprint = {2007.06105},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-06105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-08357,
author = {Giulia Bernardini and
Gabriele Fici and
Pawel Gawrychowski and
Solon P. Pissis},
title = {Substring Complexity in Sublinear Space},
journal = {CoRR},
volume = {abs/2007.08357},
year = {2020},
url = {https://arxiv.org/abs/2007.08357},
eprinttype = {arXiv},
eprint = {2007.08357},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-08357.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-02060,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {A Note on a Recent Algorithm for Minimum Cut},
journal = {CoRR},
volume = {abs/2008.02060},
year = {2020},
url = {https://arxiv.org/abs/2008.02060},
eprinttype = {arXiv},
eprint = {2008.02060},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-02060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-13209,
author = {Pawel Gawrychowski and
Tomasz Kociumaka and
Wojciech Rytter and
Tomasz Walen},
title = {Tight Bound for the Number of Distinct Palindromes in a Tree},
journal = {CoRR},
volume = {abs/2008.13209},
year = {2020},
url = {https://arxiv.org/abs/2008.13209},
eprinttype = {arXiv},
eprint = {2008.13209},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-13209.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-00348,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
title = {Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles
in Graphs},
journal = {CoRR},
volume = {abs/2010.00348},
year = {2020},
url = {https://arxiv.org/abs/2010.00348},
eprinttype = {arXiv},
eprint = {2010.00348},
timestamp = {Mon, 12 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-00348.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-05644,
author = {Giulia Bernardini and
Paola Bonizzoni and
Pawel Gawrychowski},
title = {Incomplete Directed Perfect Phylogeny in Linear Time},
journal = {CoRR},
volume = {abs/2010.05644},
year = {2020},
url = {https://arxiv.org/abs/2010.05644},
eprinttype = {arXiv},
eprint = {2010.05644},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-05644.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-09761,
author = {Pawel Gawrychowski and
Wojciech Janczewski},
title = {Fully Dynamic Approximation of {LIS} in Polylogarithmic Time},
journal = {CoRR},
volume = {abs/2011.09761},
year = {2020},
url = {https://arxiv.org/abs/2011.09761},
eprinttype = {arXiv},
eprint = {2011.09761},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-09761.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GawrychowskiMSU19,
author = {Pawel Gawrychowski and
Oleg Merkurev and
Arseny M. Shur and
Przemyslaw Uznanski},
title = {Tight Tradeoffs for Real-Time Approximation of Longest Palindromes
in Streams},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3630--3654},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00591-8},
doi = {10.1007/S00453-019-00591-8},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GawrychowskiMSU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GawrychowskiMMN19,
author = {Pawel Gawrychowski and
Florin Manea and
Robert Mercas and
Dirk Nowotka},
title = {Hide and seek with repetitions},
journal = {J. Comput. Syst. Sci.},
volume = {101},
pages = {42--67},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2018.10.004},
doi = {10.1016/J.JCSS.2018.10.004},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/GawrychowskiMMN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Gawrychowski19,
author = {Pawel Gawrychowski},
editor = {Nadia Pisanti and
Solon P. Pissis},
title = {How to Exploit Periodicity (Invited Talk)},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
June 18-20, 2019, Pisa, Italy},
series = {LIPIcs},
volume = {128},
pages = {1:1--1:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CPM.2019.1},
doi = {10.4230/LIPICS.CPM.2019.1},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/Gawrychowski19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiS19,
author = {Pawel Gawrychowski and
Tatiana Starikovskaya},
editor = {Nadia Pisanti and
Solon P. Pissis},
title = {Streaming Dictionary Matching with Mismatches},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
June 18-20, 2019, Pisa, Italy},
series = {LIPIcs},
volume = {128},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CPM.2019.21},
doi = {10.4230/LIPICS.CPM.2019.21},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiRS19,
author = {Pawel Gawrychowski and
Jakub Radoszewski and
Tatiana Starikovskaya},
editor = {Nadia Pisanti and
Solon P. Pissis},
title = {Quasi-Periodicity in Streams},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
June 18-20, 2019, Pisa, Italy},
series = {LIPIcs},
volume = {128},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CPM.2019.22},
doi = {10.4230/LIPICS.CPM.2019.22},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001GPPR19,
author = {Giulia Bernardini and
Pawel Gawrychowski and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.21},
doi = {10.4230/LIPICS.ICALP.2019.21},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/0001GPPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BilleGGLW19,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Top Tree Compression of Tries},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {4:1--4:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.4},
doi = {10.4230/LIPICS.ISAAC.2019.4},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BilleGGLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CliffordGKMU19,
author = {Rapha{\"{e}}l Clifford and
Pawel Gawrychowski and
Tomasz Kociumaka and
Daniel P. Martin and
Przemyslaw Uznanski},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {{RLE} Edit Distance in Near Optimal Time},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {66:1--66:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.66},
doi = {10.4230/LIPICS.MFCS.2019.66},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CliffordGKMU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/FiciG19,
author = {Gabriele Fici and
Pawel Gawrychowski},
editor = {Nieves R. Brisaboa and
Simon J. Puglisi},
title = {Minimal Absent Words in Rooted and Unrooted Trees},
booktitle = {String Processing and Information Retrieval - 26th International Symposium,
{SPIRE} 2019, Segovia, Spain, October 7-9, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11811},
pages = {152--161},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-32686-9\_11},
doi = {10.1007/978-3-030-32686-9\_11},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/FiciG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GawrychowskiMS19,
author = {Pawel Gawrychowski and
Florin Manea and
Radoslaw Serafin},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Fast and Longest Rollercoasters},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {30:1--30:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.30},
doi = {10.4230/LIPICS.STACS.2019.30},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GawrychowskiMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Charalampopoulos19,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Moses Charikar and
Edith Cohen},
title = {Almost optimal distance oracles for planar graphs},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {138--151},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316316},
doi = {10.1145/3313276.3316316},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Charalampopoulos19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DudekG19,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
editor = {Moses Charikar and
Edith Cohen},
title = {Computing quartet distance is equivalent to counting 4-cycles},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {733--743},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316390},
doi = {10.1145/3313276.3316390},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DudekG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-02187,
author = {Philip Bille and
Inge Li G{\o}rtz and
Pawel Gawrychowski and
Gad M. Landau and
Oren Weimann},
title = {Top Tree Compression of Tries},
journal = {CoRR},
volume = {abs/1902.02187},
year = {2019},
url = {http://arxiv.org/abs/1902.02187},
eprinttype = {arXiv},
eprint = {1902.02187},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-02187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-04427,
author = {Pawel Gawrychowski and
Seungbum Jo and
Shay Mozes and
Oren Weimann},
title = {Compressed Range Minimum Queries},
journal = {CoRR},
volume = {abs/1902.04427},
year = {2019},
url = {http://arxiv.org/abs/1902.04427},
eprinttype = {arXiv},
eprint = {1902.04427},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-04427.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-01254,
author = {Rapha{\"{e}}l Clifford and
Pawel Gawrychowski and
Tomasz Kociumaka and
Daniel P. Martin and
Przemyslaw Uznanski},
title = {{RLE} edit distance in near optimal time},
journal = {CoRR},
volume = {abs/1905.01254},
year = {2019},
url = {http://arxiv.org/abs/1905.01254},
eprinttype = {arXiv},
eprint = {1905.01254},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-01254.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-02298,
author = {Giulia Bernardini and
Pawel Gawrychowski and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
title = {Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication},
journal = {CoRR},
volume = {abs/1905.02298},
year = {2019},
url = {http://arxiv.org/abs/1905.02298},
eprinttype = {arXiv},
eprint = {1905.02298},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-02298.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-12034,
author = {Gabriele Fici and
Pawel Gawrychowski},
title = {Minimal Absent Words in Rooted and Unrooted Trees},
journal = {CoRR},
volume = {abs/1907.12034},
year = {2019},
url = {http://arxiv.org/abs/1907.12034},
eprinttype = {arXiv},
eprint = {1907.12034},
timestamp = {Thu, 01 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-12034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01145,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Minimum Cut in O(m log\({}^{\mbox{2}}\)n) Time},
journal = {CoRR},
volume = {abs/1911.01145},
year = {2019},
url = {http://arxiv.org/abs/1911.01145},
eprinttype = {arXiv},
eprint = {1911.01145},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01145.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GawrychowskiIIK18,
author = {Pawel Gawrychowski and
Tomohiro I and
Shunsuke Inenaga and
Dominik K{\"{o}}ppl and
Florin Manea},
title = {Tighter Bounds and Optimal Algorithms for All Maximal {\(\alpha\)}-gapped
Repeats and Palindromes - Finding All Maximal {\(\alpha\)}-gapped
Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets},
journal = {Theory Comput. Syst.},
volume = {62},
number = {1},
pages = {162--191},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9794-5},
doi = {10.1007/S00224-017-9794-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GawrychowskiIIK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GawrychowskiZ18,
author = {Pawel Gawrychowski and
Lukasz Zatorski},
title = {Speeding up dynamic programming in the line-constrained k-median},
journal = {Theory Comput. Syst.},
volume = {62},
number = {6},
pages = {1351--1365},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9780-y},
doi = {10.1007/S00224-017-9780-Y},
timestamp = {Tue, 10 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GawrychowskiZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GawrychowskiLMW18,
author = {Pawel Gawrychowski and
Gad M. Landau and
Shay Mozes and
Oren Weimann},
title = {The nearest colored node in a tree},
journal = {Theor. Comput. Sci.},
volume = {710},
pages = {66--73},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.08.021},
doi = {10.1016/J.TCS.2017.08.021},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GawrychowskiLMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/complexnetworks/SchickedanzA0G18,
author = {Alexander Schickedanz and
Deepak Ajwani and
Ulrich Meyer and
Pawel Gawrychowski},
editor = {Luca Maria Aiello and
Chantal Cherifi and
Hocine Cherifi and
Renaud Lambiotte and
Pietro Li{\'{o}} and
Luis M. Rocha},
title = {Average-Case Behavior of k-Shortest Path Algorithms},
booktitle = {Complex Networks and Their Applications {VII} - Volume 1 Proceedings
The 7th International Conference on Complex Networks and Their Applications
{COMPLEX} {NETWORKS} 2018, Cambridge, UK, December 11-13, 2018},
series = {Studies in Computational Intelligence},
volume = {812},
pages = {28--40},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-05411-3\_3},
doi = {10.1007/978-3-030-05411-3\_3},
timestamp = {Thu, 07 Jul 2022 13:32:56 +0200},
biburl = {https://dblp.org/rec/conf/complexnetworks/SchickedanzA0G18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/DudekG18,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
editor = {Gonzalo Navarro and
David Sankoff and
Binhai Zhu},
title = {Slowing Down Top Trees for Better Worst-Case Compression},
booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, July
2-4, 2018 - Qingdao, China},
series = {LIPIcs},
volume = {105},
pages = {16:1--16:8},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CPM.2018.16},
doi = {10.4230/LIPICS.CPM.2018.16},
timestamp = {Wed, 28 Feb 2024 00:16:40 +0100},
biburl = {https://dblp.org/rec/conf/cpm/DudekG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChangGMW18,
author = {Hsien{-}Chih Chang and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Near-Optimal Distance Emulator for Planar Graphs},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {16:1--16:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.16},
doi = {10.4230/LIPICS.ESA.2018.16},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChangGMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GanczorzGJK18,
author = {Michal Ganczorz and
Pawel Gawrychowski and
Artur Jez and
Tomasz Kociumaka},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Edit Distance with Block Operations},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {33:1--33:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.33},
doi = {10.4230/LIPICS.ESA.2018.33},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GanczorzGJK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DudekG18,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Edit Distance between Unrooted Trees in Cubic Time},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {45:1--45:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.45},
doi = {10.4230/LIPICS.ICALP.2018.45},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DudekG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiK18,
author = {Pawel Gawrychowski and
Adam Karczmarz},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Improved Bounds for Shortest Paths in Dense Distance Graphs},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {61:1--61:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.61},
doi = {10.4230/LIPICS.ICALP.2018.61},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiU18,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Towards Unified Approximate Pattern Matching for Hamming and L{\_}1
Distance},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {62:1--62:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.62},
doi = {10.4230/LIPICS.ICALP.2018.62},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiLSW18,
author = {Pawel Gawrychowski and
Gad M. Landau and
Wing{-}Kin Sung and
Oren Weimann},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {A Faster Construction of Greedy Consensus Trees},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {63:1--63:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.63},
doi = {10.4230/LIPICS.ICALP.2018.63},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiLSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiMW18,
author = {Pawel Gawrychowski and
Liran Markin and
Oren Weimann},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {A Faster {FPTAS} for {\#}Knapsack},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {64:1--64:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.64},
doi = {10.4230/LIPICS.ICALP.2018.64},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GawrychowskiLS18,
author = {Pawel Gawrychowski and
Gad M. Landau and
Tatiana Starikovskaya},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {Fast Entropy-Bounded String Dictionary Look-Up with Mismatches},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {66:1--66:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.66},
doi = {10.4230/LIPICS.MFCS.2018.66},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GawrychowskiLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiKMS18,
author = {Pawel Gawrychowski and
Haim Kaplan and
Shay Mozes and
Micha Sharir and
Oren Weimann},
editor = {Artur Czumaj},
title = {Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic
\emph{{\~{O}}}(\emph{n}\({}^{\mbox{5/3}}\)) Time},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {495--514},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.33},
doi = {10.1137/1.9781611975031.33},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiKMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiMWW18,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann and
Christian Wulff{-}Nilsen},
editor = {Artur Czumaj},
title = {Better Tradeoffs for Exact Distance Oracles in Planar Graphs},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {515--529},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.34},
doi = {10.1137/1.9781611975031.34},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiMWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbboudGMW18,
author = {Amir Abboud and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Artur Czumaj},
title = {Near-Optimal Compression for the Planar Graph Metric},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {530--549},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.35},
doi = {10.1137/1.9781611975031.35},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AbboudGMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannGMW18,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Artur Czumaj},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless
{APSP} can)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1190--1206},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.77},
doi = {10.1137/1.9781611975031.77},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BringmannGMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiKKL18,
author = {Pawel Gawrychowski and
Adam Karczmarz and
Tomasz Kociumaka and
Jakub Lacki and
Piotr Sankowski},
editor = {Artur Czumaj},
title = {Optimal Dynamic Strings},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1509--1528},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.99},
doi = {10.1137/1.9781611975031.99},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiKKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiKLP18,
author = {Pawel Gawrychowski and
Fabian Kuhn and
Jakub Lopuszanski and
Konstantinos Panagiotou and
Pascal Su},
editor = {Artur Czumaj},
title = {Labeling Schemes for Nearest Common Ancestors through Minor-Universal
Trees},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2604--2619},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.166},
doi = {10.1137/1.9781611975031.166},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiKLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-01059,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
title = {Slowing Down Top Trees for Better Worst-Case Bounds},
journal = {CoRR},
volume = {abs/1801.01059},
year = {2018},
url = {http://arxiv.org/abs/1801.01059},
eprinttype = {arXiv},
eprint = {1801.01059},
timestamp = {Thu, 15 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-01059.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-05791,
author = {Pawel Gawrychowski and
Liran Markin and
Oren Weimann},
title = {A Faster {FPTAS} for {\#}Knapsack},
journal = {CoRR},
volume = {abs/1802.05791},
year = {2018},
url = {http://arxiv.org/abs/1802.05791},
eprinttype = {arXiv},
eprint = {1802.05791},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-05791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-10186,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
title = {Edit Distance between Unrooted Trees in Cubic Time},
journal = {CoRR},
volume = {abs/1804.10186},
year = {2018},
url = {http://arxiv.org/abs/1804.10186},
eprinttype = {arXiv},
eprint = {1804.10186},
timestamp = {Thu, 15 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-10186.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-09646,
author = {Pawel Gawrychowski and
Gad M. Landau and
Tatiana Starikovskaya},
title = {Fast entropy-bounded string dictionary look-up with mismatches},
journal = {CoRR},
volume = {abs/1806.09646},
year = {2018},
url = {http://arxiv.org/abs/1806.09646},
eprinttype = {arXiv},
eprint = {1806.09646},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-09646.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-01478,
author = {Hsien{-}Chih Chang and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Near-Optimal Distance Emulator for Planar Graphs},
journal = {CoRR},
volume = {abs/1807.01478},
year = {2018},
url = {http://arxiv.org/abs/1807.01478},
eprinttype = {arXiv},
eprint = {1807.01478},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-01478.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-02517,
author = {Pawel Gawrychowski and
Tatiana Starikovskaya},
title = {Streaming dictionary matching with mismatches},
journal = {CoRR},
volume = {abs/1809.02517},
year = {2018},
url = {http://arxiv.org/abs/1809.02517},
eprinttype = {arXiv},
eprint = {1809.02517},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-02517.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-07422,
author = {Pawel Gawrychowski and
Florin Manea and
Radoslaw Serafin},
title = {Fast and Longest Rollercoasters},
journal = {CoRR},
volume = {abs/1810.07422},
year = {2018},
url = {http://arxiv.org/abs/1810.07422},
eprinttype = {arXiv},
eprint = {1810.07422},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-07422.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01551,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Almost Optimal Distance Oracles for Planar Graphs},
journal = {CoRR},
volume = {abs/1811.01551},
year = {2018},
url = {http://arxiv.org/abs/1811.01551},
eprinttype = {arXiv},
eprint = {1811.01551},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-01551.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-06244,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
title = {Computing Quartet Distance is Equivalent to Counting 4-Cycles},
journal = {CoRR},
volume = {abs/1811.06244},
year = {2018},
url = {http://arxiv.org/abs/1811.06244},
eprinttype = {arXiv},
eprint = {1811.06244},
timestamp = {Thu, 15 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-06244.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-07072,
author = {Nathana{\"{e}}l Fijalkow and
Pawel Gawrychowski and
Pierre Ohlmann},
title = {The complexity of mean payoff games using universal graphs},
journal = {CoRR},
volume = {abs/1812.07072},
year = {2018},
url = {http://arxiv.org/abs/1812.07072},
eprinttype = {arXiv},
eprint = {1812.07072},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-07072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/DumitranGM17,
author = {Marius Dumitran and
Pawel Gawrychowski and
Florin Manea},
title = {Longest Gapped Repeats and Palindromes},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {19},
number = {4},
year = {2017},
url = {https://doi.org/10.23638/DMTCS-19-4-4},
doi = {10.23638/DMTCS-19-4-4},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/DumitranGM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/DudekGO17,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Piotr Ostropolski{-}Nalewaja},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {A Family of Approximation Algorithms for the Maximum Duo-Preservation
String Mapping Problem},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {10:1--10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.10},
doi = {10.4230/LIPICS.CPM.2017.10},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/DudekGO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GawrychowskiKMW17,
author = {Pawel Gawrychowski and
Nadav Krasnopolsky and
Shay Mozes and
Oren Weimann},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Dispersion on Trees},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {40:1--40:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.40},
doi = {10.4230/LIPICS.ESA.2017.40},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/GawrychowskiKMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/FreedmanGNW17,
author = {Ofer Freedman and
Pawel Gawrychowski and
Patrick K. Nicholson and
Oren Weimann},
editor = {Elad Michael Schiller and
Alexander A. Schwarzmann},
title = {Optimal Distance Labeling Schemes for Trees},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing,
{PODC} 2017, Washington, DC, USA, July 25-27, 2017},
pages = {185--194},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087801.3087804},
doi = {10.1145/3087801.3087804},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/FreedmanGNW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiK17,
author = {Pawel Gawrychowski and
Tomasz Kociumaka},
editor = {Philip N. Klein},
title = {Sparse Suffix Tree Construction in Optimal Time and Space},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {425--439},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.27},
doi = {10.1137/1.9781611974782.27},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/AmitG17,
author = {Mika Amit and
Pawel Gawrychowski},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
title = {Distinct Squares in Circular Words},
booktitle = {String Processing and Information Retrieval - 24th International Symposium,
{SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10508},
pages = {27--37},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67428-5\_3},
doi = {10.1007/978-3-319-67428-5\_3},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/AmitG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GawrychowskiN17,
author = {Pawel Gawrychowski and
Patrick K. Nicholson},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Optimal Query Time for Encoding Range Majority},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {409--420},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_35},
doi = {10.1007/978-3-319-62127-2\_35},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/GawrychowskiN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DudekGO17,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Piotr Ostropolski{-}Nalewaja},
title = {A family of approximation algorithms for the maximum duo-preservation
string mapping problem},
journal = {CoRR},
volume = {abs/1702.02405},
year = {2017},
url = {http://arxiv.org/abs/1702.02405},
eprinttype = {arXiv},
eprint = {1702.02405},
timestamp = {Thu, 15 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DudekGO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiRSS17,
author = {Pawel Gawrychowski and
Narad Rampersad and
Jeffrey O. Shallit and
Marek Szykula},
title = {Existential length universality},
journal = {CoRR},
volume = {abs/1702.03961},
year = {2017},
url = {http://arxiv.org/abs/1702.03961},
eprinttype = {arXiv},
eprint = {1702.03961},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbboudGMW17,
author = {Amir Abboud and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Near-Optimal Compression for the Planar Graph Metric},
journal = {CoRR},
volume = {abs/1703.04814},
year = {2017},
url = {http://arxiv.org/abs/1703.04814},
eprinttype = {arXiv},
eprint = {1703.04814},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbboudGMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannGMW17,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless
{APSP} can)},
journal = {CoRR},
volume = {abs/1703.08940},
year = {2017},
url = {http://arxiv.org/abs/1703.08940},
eprinttype = {arXiv},
eprint = {1703.08940},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannGMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiU17,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
title = {Optimal trade-offs for pattern matching with k mismatches},
journal = {CoRR},
volume = {abs/1704.01311},
year = {2017},
url = {http://arxiv.org/abs/1704.01311},
eprinttype = {arXiv},
eprint = {1704.01311},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiKMS17,
author = {Pawel Gawrychowski and
Haim Kaplan and
Shay Mozes and
Micha Sharir and
Oren Weimann},
title = {Voronoi diagrams on planar graphs, and computing the diameter in deterministic
O{\~}(n\({}^{\mbox{5/3}}\)) time},
journal = {CoRR},
volume = {abs/1704.02793},
year = {2017},
url = {http://arxiv.org/abs/1704.02793},
eprinttype = {arXiv},
eprint = {1704.02793},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiKMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiN17,
author = {Pawel Gawrychowski and
Patrick K. Nicholson},
title = {Optimal Query Time for Encoding Range Majority},
journal = {CoRR},
volume = {abs/1704.06149},
year = {2017},
url = {http://arxiv.org/abs/1704.06149},
eprinttype = {arXiv},
eprint = {1704.06149},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiLSW17,
author = {Pawel Gawrychowski and
Gad M. Landau and
Wing{-}Kin Sung and
Oren Weimann},
title = {A Faster Construction of Phylogenetic Consensus Trees},
journal = {CoRR},
volume = {abs/1705.10548},
year = {2017},
url = {http://arxiv.org/abs/1705.10548},
eprinttype = {arXiv},
eprint = {1705.10548},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiLSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiKMW17,
author = {Pawel Gawrychowski and
Nadav Krasnopolsky and
Shay Mozes and
Oren Weimann},
title = {Dispersion on Trees},
journal = {CoRR},
volume = {abs/1706.09185},
year = {2017},
url = {http://arxiv.org/abs/1706.09185},
eprinttype = {arXiv},
eprint = {1706.09185},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiKMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiL17,
author = {Pawel Gawrychowski and
Jakub Lopuszanski},
title = {Better Labeling Schemes for Nearest Common Ancestors through Minor-Universal
Trees},
journal = {CoRR},
volume = {abs/1707.06011},
year = {2017},
url = {http://arxiv.org/abs/1707.06011},
eprinttype = {arXiv},
eprint = {1707.06011},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-00639,
author = {Mika Amit and
Pawel Gawrychowski},
title = {Distinct Squares in Circular Words},
journal = {CoRR},
volume = {abs/1708.00639},
year = {2017},
url = {http://arxiv.org/abs/1708.00639},
eprinttype = {arXiv},
eprint = {1708.00639},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-00639.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-01386,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann and
Christian Wulff{-}Nilsen},
title = {Better Tradeoffs for Exact Distance Oracles in Planar Graphs},
journal = {CoRR},
volume = {abs/1708.01386},
year = {2017},
url = {http://arxiv.org/abs/1708.01386},
eprinttype = {arXiv},
eprint = {1708.01386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-01386.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BilleGGLW16,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
title = {Longest common extensions in trees},
journal = {Theor. Comput. Sci.},
volume = {638},
pages = {98--107},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.08.009},
doi = {10.1016/J.TCS.2015.08.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BilleGGLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BabenkoGKKS16,
author = {Maxim A. Babenko and
Pawel Gawrychowski and
Tomasz Kociumaka and
Ignat I. Kolesnichenko and
Tatiana Starikovskaya},
title = {Computing minimal and maximal suffixes of a substring},
journal = {Theor. Comput. Sci.},
volume = {638},
pages = {112--121},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.08.023},
doi = {10.1016/J.TCS.2015.08.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BabenkoGKKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GawrychowskiU16,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
title = {Order-preserving pattern matching with k mismatches},
journal = {Theor. Comput. Sci.},
volume = {638},
pages = {136--144},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.08.022},
doi = {10.1016/J.TCS.2015.08.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GawrychowskiU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiKRW16,
author = {Pawel Gawrychowski and
Tomasz Kociumaka and
Wojciech Rytter and
Tomasz Walen},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {Faster Longest Common Extension Queries in Strings over General Alphabets},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {5:1--5:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.5},
doi = {10.4230/LIPICS.CPM.2016.5},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiKRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiMSU16,
author = {Pawel Gawrychowski and
Oleg Merkurev and
Arseny M. Shur and
Przemyslaw Uznanski},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {Tight Tradeoffs for Real-Time Approximation of Longest Palindromes
in Streams},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {18:1--18:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.18},
doi = {10.4230/LIPICS.CPM.2016.18},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiMSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiLMW16,
author = {Pawel Gawrychowski and
Gad M. Landau and
Shay Mozes and
Oren Weimann},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {The Nearest Colored Node in a Tree},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {25:1--25:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.25},
doi = {10.4230/LIPICS.CPM.2016.25},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiLMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GawrychowskiJ16,
author = {Pawel Gawrychowski and
Artur Jez},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {{LZ77} Factorisation of Trees},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {35:1--35:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.35},
doi = {10.4230/LIPICS.FSTTCS.2016.35},
timestamp = {Tue, 30 Nov 2021 13:29:05 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/GawrychowskiJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GawrychowskiZ16,
author = {Pawel Gawrychowski and
Lukasz Zatorski},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Speeding up Dynamic Programming in the Line-Constrained k-median},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {293--305},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_23},
doi = {10.1007/978-3-319-44543-4\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GawrychowskiZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GawrychowskiKU16,
author = {Pawel Gawrychowski and
Adrian Kosowski and
Przemyslaw Uznanski},
editor = {George Giakkoupis},
title = {Brief Announcement: Sublinear-Space Distance Labeling Using Hubs},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {43--45},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933077},
doi = {10.1145/2933057.2933077},
timestamp = {Tue, 06 Nov 2018 11:07:19 +0100},
biburl = {https://dblp.org/rec/conf/podc/GawrychowskiKU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/CordingGW16,
author = {Patrick Hagge Cording and
Pawel Gawrychowski and
Oren Weimann},
editor = {Shunsuke Inenaga and
Kunihiko Sadakane and
Tetsuya Sakai},
title = {Bookmarks in Grammar-Compressed Strings},
booktitle = {String Processing and Information Retrieval - 23rd International Symposium,
{SPIRE} 2016, Beppu, Japan, October 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9954},
pages = {153--159},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-46049-9\_15},
doi = {10.1007/978-3-319-46049-9\_15},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/CordingGW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GawrychowskiIIK16,
author = {Pawel Gawrychowski and
Tomohiro I and
Shunsuke Inenaga and
Dominik K{\"{o}}ppl and
Florin Manea},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Efficiently Finding All Maximal alpha-gapped Repeats},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {39:1--39:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.39},
doi = {10.4230/LIPICS.STACS.2016.39},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GawrychowskiIIK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GawrychowskiSU16,
author = {Pawel Gawrychowski and
Jukka Suomela and
Przemyslaw Uznanski},
editor = {Rasmus Pagh},
title = {Randomized Algorithms for Finding a Majority Element},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.9},
doi = {10.4230/LIPICS.SWAT.2016.9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GawrychowskiSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/GawrychowskiKU16,
author = {Pawel Gawrychowski and
Adrian Kosowski and
Przemyslaw Uznanski},
editor = {Cyril Gavoille and
David Ilcinkas},
title = {Sublinear-Space Distance Labeling Using Hubs},
booktitle = {Distributed Computing - 30th International Symposium, {DISC} 2016,
Paris, France, September 27-29, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9888},
pages = {230--242},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53426-7\_17},
doi = {10.1007/978-3-662-53426-7\_17},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/GawrychowskiKU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiKRW16,
author = {Pawel Gawrychowski and
Tomasz Kociumaka and
Wojciech Rytter and
Tomasz Walen},
title = {Faster Longest Common Extension Queries in Strings over General Alphabets},
journal = {CoRR},
volume = {abs/1602.00447},
year = {2016},
url = {http://arxiv.org/abs/1602.00447},
eprinttype = {arXiv},
eprint = {1602.00447},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiKRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiK16,
author = {Pawel Gawrychowski and
Adam Karczmarz},
title = {Improved Bounds for Shortest Paths in Dense Distance Graphs},
journal = {CoRR},
volume = {abs/1602.07013},
year = {2016},
url = {http://arxiv.org/abs/1602.07013},
eprinttype = {arXiv},
eprint = {1602.07013},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiSU16,
author = {Pawel Gawrychowski and
Jukka Suomela and
Przemyslaw Uznanski},
title = {Randomized algorithms for finding a majority element},
journal = {CoRR},
volume = {abs/1603.01583},
year = {2016},
url = {http://arxiv.org/abs/1603.01583},
eprinttype = {arXiv},
eprint = {1603.01583},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FreedmanGNW16,
author = {Ofer Freedman and
Pawel Gawrychowski and
Patrick K. Nicholson and
Oren Weimann},
title = {Optimal Distance Labeling Schemes for Trees},
journal = {CoRR},
volume = {abs/1608.00212},
year = {2016},
url = {http://arxiv.org/abs/1608.00212},
eprinttype = {arXiv},
eprint = {1608.00212},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FreedmanGNW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiK16a,
author = {Pawel Gawrychowski and
Tomasz Kociumaka},
title = {Sparse Suffix Tree Construction in Optimal Time and Space},
journal = {CoRR},
volume = {abs/1608.00865},
year = {2016},
url = {http://arxiv.org/abs/1608.00865},
eprinttype = {arXiv},
eprint = {1608.00865},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiK16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiMSU16,
author = {Pawel Gawrychowski and
Oleg Merkurev and
Arseny M. Shur and
Przemyslaw Uznanski},
title = {Tight Tradeoffs for Real-Time Approximation of Longest Palindromes
in Streams},
journal = {CoRR},
volume = {abs/1610.03125},
year = {2016},
url = {http://arxiv.org/abs/1610.03125},
eprinttype = {arXiv},
eprint = {1610.03125},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiMSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiU16,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
title = {A note on distance labeling in planar graphs},
journal = {CoRR},
volume = {abs/1611.06529},
year = {2016},
url = {http://arxiv.org/abs/1611.06529},
eprinttype = {arXiv},
eprint = {1611.06529},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GagieGP15,
author = {Travis Gagie and
Pawel Gawrychowski and
Simon J. Puglisi},
title = {Approximate pattern matching in LZ77-compressed texts},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {64--68},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.10.003},
doi = {10.1016/J.JDA.2014.10.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GagieGP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGGLW15,
author = {Philip Bille and
Pawel Gawrychowski and
Inge Li G{\o}rtz and
Gad M. Landau and
Oren Weimann},
editor = {Ferdinando Cicalese and
Ely Porat and
Ugo Vaccaro},
title = {Longest Common Extensions in Trees},
booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015,
Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9133},
pages = {52--64},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19929-0\_5},
doi = {10.1007/978-3-319-19929-0\_5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BilleGGLW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/0001G15,
author = {Johannes Fischer and
Pawel Gawrychowski},
editor = {Ferdinando Cicalese and
Ely Porat and
Ugo Vaccaro},
title = {Alphabet-Dependent String Searching with Wexponential Search Trees},
booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015,
Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9133},
pages = {160--171},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19929-0\_14},
doi = {10.1007/978-3-319-19929-0\_14},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/0001G15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiN15,
author = {Pawel Gawrychowski and
Patrick K. Nicholson},
editor = {Ferdinando Cicalese and
Ely Porat and
Ugo Vaccaro},
title = {Encodings of Range Maximum-Sum Segment Queries and Applications},
booktitle = {Combinatorial Pattern Matching - 26th Annual Symposium, {CPM} 2015,
Ischia Island, Italy, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9133},
pages = {196--206},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19929-0\_17},
doi = {10.1007/978-3-319-19929-0\_17},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/BelazzouguiGGKO15,
author = {Djamal Belazzougui and
Travis Gagie and
Pawel Gawrychowski and
Juha K{\"{a}}rkk{\"{a}}inen and
Alberto Ord{\'{o}}{\~{n}}ez Pereira and
Simon J. Puglisi and
Yasuo Tabei},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {Queries on LZ-Bounded Encodings},
booktitle = {2015 Data Compression Conference, {DCC} 2015, Snowbird, UT, USA, April
7-9, 2015},
pages = {83--92},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/DCC.2015.69},
doi = {10.1109/DCC.2015.69},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcc/BelazzouguiGGKO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001GGK15,
author = {Johannes Fischer and
Travis Gagie and
Pawel Gawrychowski and
Tomasz Kociumaka},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Approximating {LZ77} via Small-Space Multiple-Pattern Matching},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {533--544},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_45},
doi = {10.1007/978-3-662-48350-3\_45},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/0001GGK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/GawrychowskiM15,
author = {Pawel Gawrychowski and
Florin Manea},
editor = {Adrian Kosowski and
Igor Walukiewicz},
title = {Longest {\(\alpha\)}-Gapped Repeat and Palindrome},
booktitle = {Fundamentals of Computation Theory - 20th International Symposium,
{FCT} 2015, Gda{\'{n}}sk, Poland, August 17-19, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9210},
pages = {27--40},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-22177-9\_3},
doi = {10.1007/978-3-319-22177-9\_3},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/GawrychowskiM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiMW15,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor
Search},
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 = {580--592},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_47},
doi = {10.1007/978-3-662-47672-7\_47},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiMW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiN15,
author = {Pawel Gawrychowski and
Patrick K. Nicholson},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Optimal Encodings for Range Top- k k , Selection, and Min-Max},
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 = {593--604},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_48},
doi = {10.1007/978-3-662-47672-7\_48},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GawrychowskiS15,
author = {Pawel Gawrychowski and
Damian Straszak},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {Strong Inapproximability of the Shortest Reset Word},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9234},
pages = {243--255},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48057-1\_19},
doi = {10.1007/978-3-662-48057-1\_19},
timestamp = {Sun, 02 Jun 2019 21:25:38 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GawrychowskiS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BabenkoGKS15,
author = {Maxim A. Babenko and
Pawel Gawrychowski and
Tomasz Kociumaka and
Tatiana Starikovskaya},
editor = {Piotr Indyk},
title = {Wavelet Trees Meet Suffix Trees},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {572--591},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.39},
doi = {10.1137/1.9781611973730.39},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/BabenkoGKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/GawrychowskiKSS15,
author = {Pawel Gawrychowski and
Gregory Kucherov and
Benjamin Sach and
Tatiana Starikovskaya},
editor = {Costas S. Iliopoulos and
Simon J. Puglisi and
Emine Yilmaz},
title = {Computing the Longest Unbordered Substring},
booktitle = {String Processing and Information Retrieval - 22nd International Symposium,
{SPIRE} 2015, London, UK, September 1-4, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9309},
pages = {246--257},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23826-5\_24},
doi = {10.1007/978-3-319-23826-5\_24},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/GawrychowskiKSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/GawrychowskiKRW15,
author = {Pawel Gawrychowski and
Tomasz Kociumaka and
Wojciech Rytter and
Tomasz Walen},
editor = {Costas S. Iliopoulos and
Simon J. Puglisi and
Emine Yilmaz},
title = {Tight Bound for the Number of Distinct Palindromes in a Tree},
booktitle = {String Processing and Information Retrieval - 22nd International Symposium,
{SPIRE} 2015, London, UK, September 1-4, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9309},
pages = {270--276},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23826-5\_26},
doi = {10.1007/978-3-319-23826-5\_26},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/GawrychowskiKRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GawrychowskiKRR15,
author = {Pawel Gawrychowski and
Tomasz Kociumaka and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Universal Reconstruction of a String},
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 = {386--397},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_32},
doi = {10.1007/978-3-319-21840-3\_32},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/GawrychowskiKRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Chalopin0GKLU15,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Shantanu Das and
Pawel Gawrychowski and
Adrian Kosowski and
Arnaud Labourel and
Przemyslaw Uznanski},
editor = {Yoram Moses},
title = {Limit Behavior of the Multi-agent Rotor-Router System},
booktitle = {Distributed Computing - 29th International Symposium, {DISC} 2015,
Tokyo, Japan, October 7-9, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9363},
pages = {123--139},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48653-5\_9},
doi = {10.1007/978-3-662-48653-5\_9},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/Chalopin0GKLU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiMW15,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor
Search},
journal = {CoRR},
volume = {abs/1502.07663},
year = {2015},
url = {http://arxiv.org/abs/1502.07663},
eprinttype = {arXiv},
eprint = {1502.07663},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiMW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0001GGK15,
author = {Johannes Fischer and
Travis Gagie and
Pawel Gawrychowski and
Tomasz Kociumaka},
title = {Approximating {LZ77} via Small-Space Multiple-Pattern Matching},
journal = {CoRR},
volume = {abs/1504.06647},
year = {2015},
url = {http://arxiv.org/abs/1504.06647},
eprinttype = {arXiv},
eprint = {1504.06647},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0001GGK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiKU15,
author = {Pawel Gawrychowski and
Adrian Kosowski and
Przemyslaw Uznanski},
title = {Even Simpler Distance Labeling for (Sparse) Graphs},
journal = {CoRR},
volume = {abs/1507.06240},
year = {2015},
url = {http://arxiv.org/abs/1507.06240},
eprinttype = {arXiv},
eprint = {1507.06240},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiKU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FreydenbergerGK15,
author = {Dominik D. Freydenberger and
Pawel Gawrychowski and
Juhani Karhum{\"{a}}ki and
Florin Manea and
Wojciech Rytter},
title = {Testing k-binomial equivalence},
journal = {CoRR},
volume = {abs/1509.00622},
year = {2015},
url = {http://arxiv.org/abs/1509.00622},
eprinttype = {arXiv},
eprint = {1509.00622},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FreydenbergerGK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiIIK15,
author = {Pawel Gawrychowski and
Tomohiro I and
Shunsuke Inenaga and
Dominik K{\"{o}}ppl and
Florin Manea},
title = {Efficiently Finding All Maximal {\textdollar}{\(\alpha\)}{\textdollar}-gapped
Repeats},
journal = {CoRR},
volume = {abs/1509.09237},
year = {2015},
url = {http://arxiv.org/abs/1509.09237},
eprinttype = {arXiv},
eprint = {1509.09237},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiIIK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiKKL15,
author = {Pawel Gawrychowski and
Adam Karczmarz and
Tomasz Kociumaka and
Jakub Lacki and
Piotr Sankowski},
title = {Optimal Dynamic Strings},
journal = {CoRR},
volume = {abs/1511.02612},
year = {2015},
url = {http://arxiv.org/abs/1511.02612},
eprinttype = {arXiv},
eprint = {1511.02612},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiKKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DumitranGM15,
author = {Marius Dumitran and
Pawel Gawrychowski and
Florin Manea},
title = {Longest Gapped Repeats and Palindromes},
journal = {CoRR},
volume = {abs/1511.07180},
year = {2015},
url = {http://arxiv.org/abs/1511.07180},
eprinttype = {arXiv},
eprint = {1511.07180},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DumitranGM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Gawrychowski14,
author = {Pawel Gawrychowski},
title = {Simple and efficient LZW-compressed multiple pattern matching},
journal = {J. Discrete Algorithms},
volume = {25},
pages = {34--41},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.10.004},
doi = {10.1016/J.JDA.2013.10.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Gawrychowski14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GawrychowskiJJ14,
author = {Pawel Gawrychowski and
Artur Jez and
Lukasz Jez},
title = {Validating the Knuth-Morris-Pratt Failure Function, Fast and Online},
journal = {Theory Comput. Syst.},
volume = {54},
number = {2},
pages = {337--372},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9522-8},
doi = {10.1007/S00224-013-9522-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GawrychowskiJJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BabenkoGKS14,
author = {Maxim A. Babenko and
Pawel Gawrychowski and
Tomasz Kociumaka and
Tatiana Starikovskaya},
editor = {Alexander S. Kulikov and
Sergei O. Kuznetsov and
Pavel A. Pevzner},
title = {Computing Minimal and Maximal Suffixes of a Substring Revisited},
booktitle = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014,
Moscow, Russia, June 16-18, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8486},
pages = {30--39},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07566-2\_4},
doi = {10.1007/978-3-319-07566-2\_4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BabenkoGKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiU14,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
editor = {Alexander S. Kulikov and
Sergei O. Kuznetsov and
Pavel A. Pevzner},
title = {Order-Preserving Pattern Matching with k Mismatches},
booktitle = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014,
Moscow, Russia, June 16-18, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8486},
pages = {130--139},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07566-2\_14},
doi = {10.1007/978-3-319-07566-2\_14},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GawrychowskiLN14,
author = {Pawel Gawrychowski and
Moshe Lewenstein and
Patrick K. Nicholson},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {Weighted Ancestors in Suffix Trees},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {455--466},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_38},
doi = {10.1007/978-3-662-44777-2\_38},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/GawrychowskiLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiMW14,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Improved Submatrix Maximum Queries in Monge Matrices},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {525--537},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_44},
doi = {10.1007/978-3-662-43948-7\_44},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GawrychowskiR14,
author = {Pawel Gawrychowski and
Damian Rusak},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Euclidean {TSP} with Few Inner Points in Linear Space},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {701--713},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_55},
doi = {10.1007/978-3-319-13075-0\_55},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GawrychowskiR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GagieGKNP14,
author = {Travis Gagie and
Pawel Gawrychowski and
Juha K{\"{a}}rkk{\"{a}}inen and
Yakov Nekrich and
Simon J. Puglisi},
editor = {Alberto Pardo and
Alfredo Viola},
title = {LZ77-Based Self-indexing with Faster Pattern Matching},
booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {731--742},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54423-1\_63},
doi = {10.1007/978-3-642-54423-1\_63},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/GagieGKNP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GawrychowskiMN14,
author = {Pawel Gawrychowski and
Florin Manea and
Dirk Nowotka},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Testing Generalised Freeness of Words},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {337--349},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.337},
doi = {10.4230/LIPICS.STACS.2014.337},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GawrychowskiMN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiR14,
author = {Pawel Gawrychowski and
Damian Rusak},
title = {Euclidean {TSP} with few inner points in linear space},
journal = {CoRR},
volume = {abs/1406.2154},
year = {2014},
url = {http://arxiv.org/abs/1406.2154},
eprinttype = {arXiv},
eprint = {1406.2154},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiLN14,
author = {Pawel Gawrychowski and
Moshe Lewenstein and
Patrick K. Nicholson},
title = {Weighted ancestors in suffix trees},
journal = {CoRR},
volume = {abs/1406.7716},
year = {2014},
url = {http://arxiv.org/abs/1406.7716},
eprinttype = {arXiv},
eprint = {1406.7716},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Chalopin0GKLU14,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Shantanu Das and
Pawel Gawrychowski and
Adrian Kosowski and
Arnaud Labourel and
Przemyslaw Uznanski},
title = {Lock-in Problem for Parallel Rotor-router Walks},
journal = {CoRR},
volume = {abs/1407.3200},
year = {2014},
url = {http://arxiv.org/abs/1407.3200},
eprinttype = {arXiv},
eprint = {1407.3200},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Chalopin0GKLU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiS14,
author = {Pawel Gawrychowski and
Damian Straszak},
title = {Strong inapproximability of the shortest reset word},
journal = {CoRR},
volume = {abs/1408.5248},
year = {2014},
url = {http://arxiv.org/abs/1408.5248},
eprinttype = {arXiv},
eprint = {1408.5248},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BabenkoGKS14,
author = {Maxim A. Babenko and
Pawel Gawrychowski and
Tomasz Kociumaka and
Tatiana Starikovskaya},
title = {Wavelet Trees Meet Suffix Trees},
journal = {CoRR},
volume = {abs/1408.6182},
year = {2014},
url = {http://arxiv.org/abs/1408.6182},
eprinttype = {arXiv},
eprint = {1408.6182},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BabenkoGKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NicholsonG14,
author = {Patrick K. Nicholson and
Pawel Gawrychowski},
title = {Encodings of Range Maximum-Sum Segment Queries and Applications},
journal = {CoRR},
volume = {abs/1410.2847},
year = {2014},
url = {http://arxiv.org/abs/1410.2847},
eprinttype = {arXiv},
eprint = {1410.2847},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NicholsonG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiU14,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
title = {Tight tradeoffs for approximating palindromes in streams},
journal = {CoRR},
volume = {abs/1410.6433},
year = {2014},
url = {http://arxiv.org/abs/1410.6433},
eprinttype = {arXiv},
eprint = {1410.6433},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiN14,
author = {Pawel Gawrychowski and
Patrick K. Nicholson},
title = {Optimal Encodings for Range Min-Max and Top-k},
journal = {CoRR},
volume = {abs/1411.6581},
year = {2014},
url = {http://arxiv.org/abs/1411.6581},
eprinttype = {arXiv},
eprint = {1411.6581},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelazzouguiGGKPPT14,
author = {Djamal Belazzougui and
Travis Gagie and
Pawel Gawrychowski and
Juha K{\"{a}}rkk{\"{a}}inen and
Alberto Ord{\'{o}}{\~{n}}ez Pereira and
Simon J. Puglisi and
Yasuo Tabei},
title = {Queries on LZ-Bounded Encodings},
journal = {CoRR},
volume = {abs/1412.0967},
year = {2014},
url = {http://arxiv.org/abs/1412.0967},
eprinttype = {arXiv},
eprint = {1412.0967},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelazzouguiGGKPPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GawrychowskiG13,
author = {Pawel Gawrychowski and
Travis Gagie},
title = {Minimax trees in linear time with applications},
journal = {Eur. J. Comb.},
volume = {34},
number = {1},
pages = {82--90},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2012.07.016},
doi = {10.1016/J.EJC.2012.07.016},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/GawrychowskiG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Gawrychowski13,
author = {Pawel Gawrychowski},
title = {Optimal Pattern Matching in {LZW} Compressed Strings},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {3},
pages = {25:1--25:17},
year = {2013},
url = {https://doi.org/10.1145/2483699.2483705},
doi = {10.1145/2483699.2483705},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Gawrychowski13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GagieGN13,
author = {Travis Gagie and
Pawel Gawrychowski and
Yakov Nekrich},
title = {Heaviest Induced Ancestors and Longest Common Substrings},
booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
{CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
url = {http://cccg.ca/proceedings/2013/papers/paper\_29.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/GagieGN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/GawrychowskiMN13,
author = {Pawel Gawrychowski and
Florin Manea and
Dirk Nowotka},
editor = {Paola Bonizzoni and
Vasco Brattka and
Benedikt L{\"{o}}we},
title = {Discovering Hidden Repetitions in Words},
booktitle = {The Nature of Computation. Logic, Algorithms, Applications - 9th Conference
on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7921},
pages = {210--219},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39053-1\_24},
doi = {10.1007/978-3-642-39053-1\_24},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/GawrychowskiMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BannaiGIT13,
author = {Hideo Bannai and
Pawel Gawrychowski and
Shunsuke Inenaga and
Masayuki Takeda},
editor = {Johannes Fischer and
Peter Sanders},
title = {Converting {SLP} to {LZ78} in almost Linear Time},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7922},
pages = {38--49},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38905-4\_6},
doi = {10.1007/978-3-642-38905-4\_6},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BannaiGIT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Gawrychowski13,
author = {Pawel Gawrychowski},
editor = {Andrei A. Bulatov and
Arseny M. Shur},
title = {Alphabetic Minimax Trees in Linear Time},
booktitle = {Computer Science - Theory and Applications - 8th International Computer
Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
25-29, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7913},
pages = {36--48},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38536-0\_4},
doi = {10.1007/978-3-642-38536-0\_4},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/Gawrychowski13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GawrychowskiS13,
author = {Pawel Gawrychowski and
Damian Straszak},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Beating {\textdollar}{\textbackslash}mathcal\{O\}(nm){\textdollar}
in Approximate LZW-Compressed Pattern Matching},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {78--88},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_8},
doi = {10.1007/978-3-642-45030-3\_8},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GawrychowskiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/GawrychowskiKNS13,
author = {Pawel Gawrychowski and
Gregory Kucherov and
Yakov Nekrich and
Tatiana Starikovskaya},
editor = {Oren Kurland and
Moshe Lewenstein and
Ely Porat},
title = {Minimal Discriminating Words Problem Revisited},
booktitle = {String Processing and Information Retrieval - 20th International Symposium,
{SPIRE} 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8214},
pages = {129--140},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-02432-5\_17},
doi = {10.1007/978-3-319-02432-5\_17},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/GawrychowskiKNS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GawrychowskiMMNT13,
author = {Pawel Gawrychowski and
Florin Manea and
Robert Mercas and
Dirk Nowotka and
Catalin Tiseanu},
editor = {Natacha Portier and
Thomas Wilke},
title = {Finding Pseudo-repetitions},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {257--268},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.257},
doi = {10.4230/LIPICS.STACS.2013.257},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GawrychowskiMMNT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-3347,
author = {Johannes Fischer and
Pawel Gawrychowski},
title = {Alphabet-Dependent String Searching with Wexponential Search Trees},
journal = {CoRR},
volume = {abs/1302.3347},
year = {2013},
url = {http://arxiv.org/abs/1302.3347},
eprinttype = {arXiv},
eprint = {1302.3347},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-3347.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-3164,
author = {Travis Gagie and
Pawel Gawrychowski and
Yakov Nekrich},
title = {Heaviest Induced Ancestors and Longest Common Substrings},
journal = {CoRR},
volume = {abs/1305.3164},
year = {2013},
url = {http://arxiv.org/abs/1305.3164},
eprinttype = {arXiv},
eprint = {1305.3164},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-3164.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiS13,
author = {Pawel Gawrychowski and
Damian Straszak},
title = {Beating O(nm) in approximate LZW-compressed pattern matching},
journal = {CoRR},
volume = {abs/1308.6509},
year = {2013},
url = {http://arxiv.org/abs/1308.6509},
eprinttype = {arXiv},
eprint = {1308.6509},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BabenkoGKS13,
author = {Maxim A. Babenko and
Pawel Gawrychowski and
Tomasz Kociumaka and
Tatiana Starikovskaya},
title = {Substring Suffix Selection},
journal = {CoRR},
volume = {abs/1309.5618},
year = {2013},
url = {http://arxiv.org/abs/1309.5618},
eprinttype = {arXiv},
eprint = {1309.5618},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BabenkoGKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiU13,
author = {Pawel Gawrychowski and
Przemyslaw Uznanski},
title = {Order-preserving pattern matching with k mismatches},
journal = {CoRR},
volume = {abs/1309.6453},
year = {2013},
url = {http://arxiv.org/abs/1309.6453},
eprinttype = {arXiv},
eprint = {1309.6453},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Gawrychowski12,
author = {Pawel Gawrychowski},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jens Stoye},
title = {Simple and Efficient LZW-Compressed Multiple Pattern Matching},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
Helsinki, Finland, July 3-5, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7354},
pages = {232--242},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31265-6\_19},
doi = {10.1007/978-3-642-31265-6\_19},
timestamp = {Tue, 21 Mar 2023 21:02:12 +0100},
biburl = {https://dblp.org/rec/conf/cpm/Gawrychowski12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/GagieGKNP12,
author = {Travis Gagie and
Pawel Gawrychowski and
Juha K{\"{a}}rkk{\"{a}}inen and
Yakov Nekrich and
Simon J. Puglisi},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide},
title = {A Faster Grammar-Based Self-index},
booktitle = {Language and Automata Theory and Applications - 6th International
Conference, {LATA} 2012, {A} Coru{\~{n}}a, Spain, March 5-9, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7183},
pages = {240--251},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28332-1\_21},
doi = {10.1007/978-3-642-28332-1\_21},
timestamp = {Sun, 02 Oct 2022 16:11:11 +0200},
biburl = {https://dblp.org/rec/conf/lata/GagieGKNP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/Gawrychowski12,
author = {Pawel Gawrychowski},
editor = {Liliana Calder{\'{o}}n{-}Benavides and
Cristina N. Gonz{\'{a}}lez{-}Caro and
Edgar Ch{\'{a}}vez and
Nivio Ziviani},
title = {Faster Algorithm for Computing the Edit Distance between SLP-Compressed
Strings},
booktitle = {String Processing and Information Retrieval - 19th International Symposium,
{SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7608},
pages = {229--236},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34109-0\_24},
doi = {10.1007/978-3-642-34109-0\_24},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/Gawrychowski12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Gawrychowski12,
author = {Pawel Gawrychowski},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Tying up the loose ends in fully LZW-compressed pattern matching},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {624--635},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.624},
doi = {10.4230/LIPICS.STACS.2012.624},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Gawrychowski12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-3208,
author = {Travis Gagie and
Pawel Gawrychowski},
title = {Linear-Space Substring Range Counting over Polylogarithmic Alphabets},
journal = {CoRR},
volume = {abs/1202.3208},
year = {2012},
url = {http://arxiv.org/abs/1202.3208},
eprinttype = {arXiv},
eprint = {1202.3208},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-3208.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-5670,
author = {Pawel Gawrychowski},
title = {(Really) Tight bounds for dispatching binary methods},
journal = {CoRR},
volume = {abs/1202.5670},
year = {2012},
url = {http://arxiv.org/abs/1202.5670},
eprinttype = {arXiv},
eprint = {1202.5670},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-5670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Gawrychowski11,
author = {Pawel Gawrychowski},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and
Deterministic},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {421--432},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_36},
doi = {10.1007/978-3-642-23719-5\_36},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Gawrychowski11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GagieGP11,
author = {Travis Gagie and
Pawel Gawrychowski and
Simon J. Puglisi},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {Faster Approximate Pattern Matching in Compressed Repetitive Texts},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {653--662},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_67},
doi = {10.1007/978-3-642-25591-5\_67},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GagieGP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GawrychowskiJM11,
author = {Pawel Gawrychowski and
Artur Jez and
Andreas Maletti},
editor = {Filip Murlak and
Piotr Sankowski},
title = {On Minimising Automata with Errors},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {327--338},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_31},
doi = {10.1007/978-3-642-22993-0\_31},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GawrychowskiJM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gawrychowski11,
author = {Pawel Gawrychowski},
editor = {Dana Randall},
title = {Optimal pattern matching in {LZW} compressed strings},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {362--372},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.29},
doi = {10.1137/1.9781611973082.29},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/Gawrychowski11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/Gawrychowski11,
author = {Pawel Gawrychowski},
editor = {B{\'{e}}atrice Bouchou{-}Markhoff and
Pascal Caron and
Jean{-}Marc Champarnaud and
Denis Maurel},
title = {Chrobak Normal Form Revisited, with Applications},
booktitle = {Implementation and Application of Automata - 16th International Conference,
{CIAA} 2011, Blois, France, July 13-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6807},
pages = {142--153},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22256-6\_14},
doi = {10.1007/978-3-642-22256-6\_14},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wia/Gawrychowski11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-5682,
author = {Pawel Gawrychowski and
Artur Jez and
Andreas Maletti},
title = {On minimising automata with errors},
journal = {CoRR},
volume = {abs/1102.5682},
year = {2011},
url = {http://arxiv.org/abs/1102.5682},
eprinttype = {arXiv},
eprint = {1102.5682},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-5682.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4203,
author = {Pawel Gawrychowski},
title = {Pattern matching in Lempel-Ziv compressed strings: fast, simple, and
deterministic},
journal = {CoRR},
volume = {abs/1104.4203},
year = {2011},
url = {http://arxiv.org/abs/1104.4203},
eprinttype = {arXiv},
eprint = {1104.4203},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4203.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-2930,
author = {Travis Gagie and
Pawel Gawrychowski and
Simon J. Puglisi},
title = {Faster Approximate Pattern Matching in Compressed Repetitive Texts},
journal = {CoRR},
volume = {abs/1109.2930},
year = {2011},
url = {http://arxiv.org/abs/1109.2930},
eprinttype = {arXiv},
eprint = {1109.2930},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-2930.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-3954,
author = {Travis Gagie and
Pawel Gawrychowski},
title = {A Faster LZ77-Based Index},
journal = {CoRR},
volume = {abs/1109.3954},
year = {2011},
url = {http://arxiv.org/abs/1109.3954},
eprinttype = {arXiv},
eprint = {1109.3954},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-3954.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-4034,
author = {Pawel Gawrychowski},
title = {Tying up the loose ends in fully LZW-compressed pattern matching},
journal = {CoRR},
volume = {abs/1109.4034},
year = {2011},
url = {http://arxiv.org/abs/1109.4034},
eprinttype = {arXiv},
eprint = {1109.4034},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-4034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GawrychowskiKRS10,
author = {Pawel Gawrychowski and
Dalia Krieger and
Narad Rampersad and
Jeffrey O. Shallit},
title = {Finding the Growth Rate of a Regular or Context-Free Language in Polynomial
Time},
journal = {Int. J. Found. Comput. Sci.},
volume = {21},
number = {4},
pages = {597--618},
year = {2010},
url = {https://doi.org/10.1142/S0129054110007441},
doi = {10.1142/S0129054110007441},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/GawrychowskiKRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ByrkaGHK10,
author = {Jaroslaw Byrka and
Pawel Gawrychowski and
Katharina T. Huber and
Steven Kelk},
title = {Worst-case optimal approximation algorithms for maximizing triplet
consistency within phylogenetic networks},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {65--75},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.01.004},
doi = {10.1016/J.JDA.2009.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ByrkaGHK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GawrychowskiGK10,
author = {Pawel Gawrychowski and
Marin Gutan and
Andrzej Kisielewicz},
title = {On the problem of freeness of multiplicative matrix semigroups},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {7-9},
pages = {1115--1120},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.12.005},
doi = {10.1016/J.TCS.2009.12.005},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GawrychowskiGK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GawrychowskiJJ10,
author = {Pawel Gawrychowski and
Artur Jez and
Lukasz Jez},
editor = {Farid M. Ablayev and
Ernst W. Mayr},
title = {Validating the Knuth-Morris-Pratt Failure Function, Fast and Online},
booktitle = {Computer Science - Theory and Applications, 5th International Computer
Science Symposium in Russia, {CSR} 2010, Kazan, Russia, June 16-20,
2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6072},
pages = {132--143},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13182-0\_13},
doi = {10.1007/978-3-642-13182-0\_13},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/GawrychowskiJJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/GagieG10,
author = {Travis Gagie and
Pawel Gawrychowski},
editor = {Adrian{-}Horia Dediu and
Henning Fernau and
Carlos Mart{\'{\i}}n{-}Vide},
title = {Grammar-Based Compression in a Streaming Model},
booktitle = {Language and Automata Theory and Applications, 4th International Conference,
{LATA} 2010, Trier, Germany, May 24-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6031},
pages = {273--284},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13089-2\_23},
doi = {10.1007/978-3-642-13089-2\_23},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/GagieG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GawrychowskiG09,
author = {Pawel Gawrychowski and
Travis Gagie},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Minimax Trees in Linear Time with Applications},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {278--288},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_28},
doi = {10.1007/978-3-642-10217-2\_28},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GawrychowskiG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GawrychowskiJ09,
author = {Pawel Gawrychowski and
Artur Jez},
editor = {Rastislav Kr{\'{a}}lovic and
Damian Niwinski},
title = {Hyper-minimisation Made Efficient},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th International
Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August
24-28, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5734},
pages = {356--368},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03816-7\_31},
doi = {10.1007/978-3-642-03816-7\_31},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GawrychowskiJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/GawrychowskiG09,
author = {Pawel Gawrychowski and
Travis Gagie},
editor = {Rudolf Ahlswede and
Ferdinando Cicalese and
Ugo Vaccaro},
title = {Minimax Trees in Linear Time with Applications},
booktitle = {Search Methodologies, 05.07. - 10.07.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09281},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/2242/},
timestamp = {Thu, 10 Jun 2021 13:02:11 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/GawrychowskiG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-2897,
author = {Pawel Gawrychowski and
Artur Jez and
Lukasz Jez},
title = {Optimal, online validation of the pi and pi' failure functions},
journal = {CoRR},
volume = {abs/0901.2897},
year = {2009},
url = {http://arxiv.org/abs/0901.2897},
eprinttype = {arXiv},
eprint = {0901.2897},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-2897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/GawrychowskiKRS08,
author = {Pawel Gawrychowski and
Dalia Krieger and
Narad Rampersad and
Jeffrey O. Shallit},
editor = {Masami Ito and
Masafumi Toyama},
title = {Finding the Growth Rate of a Regular of Context-Free Language in Polynomial
Time},
booktitle = {Developments in Language Theory, 12th International Conference, {DLT}
2008, Kyoto, Japan, September 16-19, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5257},
pages = {339--358},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85780-8\_27},
doi = {10.1007/978-3-540-85780-8\_27},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dlt/GawrychowskiKRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/GawrychowskiK08,
author = {Pawel Gawrychowski and
Andrzej Kisielewicz},
editor = {Carlos Mart{\'{\i}}n{-}Vide and
Friedrich Otto and
Henning Fernau},
title = {2-Synchronizing Words},
booktitle = {Language and Automata Theory and Applications, Second International
Conference, {LATA} 2008, Tarragona, Spain, March 13-19, 2008. Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {5196},
pages = {221--231},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-88282-4\_21},
doi = {10.1007/978-3-540-88282-4\_21},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/GawrychowskiK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-2868,
author = {Pawel Gawrychowski and
Travis Gagie},
title = {Minimax Trees in Linear Time},
journal = {CoRR},
volume = {abs/0812.2868},
year = {2008},
url = {http://arxiv.org/abs/0812.2868},
eprinttype = {arXiv},
eprint = {0812.2868},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-2868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CherubiniGKP06,
author = {Alessandra Cherubini and
Pawel Gawrychowski and
Andrzej Kisielewicz and
Brunetto Piochi},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {A Combinatorial Approach to Collapsing Words},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {256--266},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_23},
doi = {10.1007/11821069\_23},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CherubiniGKP06.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:23 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:
