default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Pawel Gawrychowski
University of Wroclaw, Poland
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 273 matches
- 2024
- Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Minimum Cut in O(mlog 2 n) Time. Theory Comput. Syst. 68(4): 814-834 (2024) - Bartlomiej Dudek, Pawel Gawrychowski:
Slowing down top trees for better worst-case compression. Theor. Comput. Sci. 1015: 114764 (2024) - Bartlomiej Dudek, Pawel Gawrychowski:
Online Context-Free Recognition in OMv Time. CPM 2024: 13:1-13:9 - Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow:
Faster Sliding Window String Indexing in Streams. CPM 2024: 8:1-8:14 - Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Consecutive Pattern Matching†. DCC 2024: 163-172 - Pawel Gawrychowski, Mateusz Wasylkiewicz:
Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity. ESA 2024: 59:1-59:14 - Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi:
Optimal Bounds for Distinct Quartics. ICALP 2024: 39:1-39:17 - Duncan Adamson, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. LATIN (1) 2024: 35-50 - Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Sorting Signed Permutations by Reversals in Nearly-Linear Time. SOSA 2024: 199-214 - Duncan Adamson, Pawel Gawrychowski, Florin Manea:
Enumerating m-Length Walks in Directed Graphs with Constant Delay. CoRR abs/2401.02163 (2024) - Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi:
Optimal Bounds for Distinct Quartics. CoRR abs/2403.06667 (2024) - Pawel Gawrychowski, Mateusz Wasylkiewicz:
Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity. CoRR abs/2405.03856 (2024) - Pawel Gawrychowski, Wojciech Janczewski:
Optimal Distance Labeling for Permutation Graphs. CoRR abs/2407.12147 (2024) - Pawel Gawrychowski, Egor Gorbachev, Tomasz Kociumaka:
Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications. CoRR abs/2408.04613 (2024) - Pawel Gawrychowski, Florin Manea, Markus L. Schmid:
Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. CoRR abs/2409.18563 (2024) - 2023
- Pawel Gawrychowski, Przemyslaw Uznanski:
Better Distance Labeling for Unweighted Planar Graphs. Algorithmica 85(6): 1805-1823 (2023) - Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. 30(2) (2023) - 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) - Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Optimal Near-Linear Space Heaviest Induced Ancestors. CPM 2023: 8:1-8:18 - Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Order-Preserving Squares in Strings. CPM 2023: 13:1-13:19 - Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Indexing for Consecutive Occurrences. CPM 2023: 12:1-12:22 - Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. ISAAC 2023: 12:1-12:19 - Jonas Ellert, Pawel Gawrychowski, Garance Gourdel:
Optimal Square Detection Over General Alphabets. SODA 2023: 5220-5242 - Pawel Gawrychowski, Maria Kosche, Florin Manea:
On the Number of Factors in the LZ-End Factorization. SPIRE 2023: 253-259 - Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau:
Order-Preserving Squares in Strings. CoRR abs/2302.00724 (2023) - Panagiotis Charalampopoulos, Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Optimal Heaviest Induced Ancestors. CoRR abs/2302.01373 (2023) - Jonas Ellert, Pawel Gawrychowski, Garance Gourdel:
Optimal Square Detection Over General Alphabets. CoRR abs/2303.07229 (2023) - Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya, Teresa Anna Steiner:
Compressed Indexing for Consecutive Occurrences. CoRR abs/2304.00887 (2023) - Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Sorting Signed Permutations by Reversals in Nearly-Linear Time. CoRR abs/2308.15928 (2023) - 2022
- Pawel Gawrychowski, Florin Manea, Radoslaw Serafin:
Fast and Longest Rollercoasters. Algorithmica 84(4): 1081-1106 (2022)
skipping 243 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-09 06:53 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint