Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Pawel Gawrychowski

◀ ▶ joint publications with Panagiotis Charalampopoulos

> Home > Persons > Pawel Gawrychowski

Publications

2024
[i100]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2403-06667
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2403-06667
Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi:
Optimal Bounds for Distinct Quartics. CoRR abs/2403.06667 (2024)
2023
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/CharalampopoulosGLMPWW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/CharalampopoulosGLMPWW23
Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen:
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70(2): 12:1-12:50 (2023)
[c125]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/cpm/Charalampopoulos23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/Charalampopoulos23
Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Optimal Near-Linear Space Heaviest Induced Ancestors. CPM 2023: 8:1-8:18
[i98]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2302-01373
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2302-01373
Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Optimal Heaviest Induced Ancestors. CoRR abs/2302.01373 (2023)
2022
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Bar-NatanCGMW22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Bar-NatanCGMW22
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. 918: 48-59 (2022)
[c110]
- view
  authority control:
- export record
  dblp key:
  - conf/spire/Charalampopoulos22a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spire/Charalampopoulos22a
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE 2022: 290-302
2021
[c109]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/Charalampopoulos21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Charalampopoulos21
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. ICALP 2021: 48:1-48:20
[c107]
- view
  authority control:
- export record
  dblp key:
  - conf/sirocco/Bar-NatanCGMW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sirocco/Bar-NatanCGMW21
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO 2021: 315-333
[i90]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2102-07154
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2102-07154
Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. CoRR abs/2102.07154 (2021)
[i88]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2103-03294
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2103-03294
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. CoRR abs/2103.03294 (2021)
2020
[c95]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/Charalampopoulos20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Charalampopoulos20
Panagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski:
Dynamic Longest Common Substring in Polylogarithmic Time. ICALP 2020: 27:1-27:19
[i74]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2006-02408
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2006-02408
Panagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski:
Dynamic Longest Common Substring in Polylogarithmic Time. CoRR abs/2006.02408 (2020)
2019
[c78]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/Charalampopoulos19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Charalampopoulos19
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost optimal distance oracles for planar graphs. STOC 2019: 138-151
2018
[i53]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1811-01551
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1811-01551
Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost Optimal Distance Oracles for Planar Graphs. CoRR abs/1811.01551 (2018)

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.