default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Nadara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Tuukka Korhonen
, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA 2024: 296-313- [c10]Adam Karczmarz, Wojciech Nadara, Marek Sokolowski:
Exact Shortest Paths with Rational Weights on the Word RAM. SODA 2024: 2597-2608 - 2023
- [j6]Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating Pathwidth for Graphs of Small Treewidth. ACM Trans. Algorithms 19(2): 16:1-16:19 (2023) - [c9]Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Dynamic treewidth. FOCS 2023: 1734-1744 - [i13]Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Dynamic treewidth. CoRR abs/2304.01744 (2023) - [i12]Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR abs/2310.20623 (2023) - [i11]Adam Karczmarz, Wojciech Nadara, Marek Sokolowski:
Exact Shortest Paths with Rational Weights on the Word RAM. CoRR abs/2311.03321 (2023) - 2022
- [j5]Wojciech Nadara, Marcin Smulewicz:
Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph. Electron. J. Comb. 29(1) (2022) - [j4]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many-visits TSP revisited. J. Comput. Syst. Sci. 124: 112-128 (2022) - [c8]Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz:
Computing Treedepth in Polynomial Space and Linear FPT Time. ESA 2022: 79:1-79:14 - [i10]Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz:
Computing treedepth in polynomial space and linear fpt time. CoRR abs/2205.02656 (2022) - 2021
- [j3]Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28(4) (2021) - [j2]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved Bounds for the Excluded-Minor Approximation of Treedepth. SIAM J. Discret. Math. 35(2): 934-947 (2021) - [c7]Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski:
Determining 4-Edge-Connected Components in Linear Time. ESA 2021: 71:1-71:15 - [c6]Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz:
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 2021: 796-809 - [c5]Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating Pathwidth for Graphs of Small Treewidth. SODA 2021: 1965-1976 - [i9]Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski:
Determining 4-edge-connected components in linear time. CoRR abs/2105.01699 (2021) - 2020
- [c4]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many Visits TSP Revisited. ESA 2020: 66:1-66:22 - [c3]Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki:
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC 2020: 37:1-37:18 - [i8]Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many visits TSP revisited. CoRR abs/2005.02329 (2020) - [i7]Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz:
On Dynamic Parameterized k-Path. CoRR abs/2006.00571 (2020) - [i6]Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating pathwidth for graphs of small treewidth. CoRR abs/2008.00779 (2020)
2010 – 2019
- 2019
- [j1]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics 24(1): 2.6:1-2.6:34 (2019) - [c2]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved Bounds for the Excluded-Minor Approximation of Treedepth. ESA 2019: 34:1-34:13 - [i5]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved bounds for the excluded-minor approximation of treedepth. CoRR abs/1904.13077 (2019) - [i4]Wojciech Nadara, Marcin Smulewicz:
Decreasing maximum average degree by deleting independent set or d-degenerate subgraph. CoRR abs/1909.10701 (2019) - [i3]Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in subcubic graphs. CoRR abs/1912.01570 (2019) - 2018
- [c1]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA 2018: 14:1-14:16 - [i2]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR abs/1802.09801 (2018) - [i1]Wojciech Nadara:
Experimental evaluation of kernelization algorithms to Dominating Set. CoRR abs/1811.07831 (2018)
Coauthor Index
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.
last updated on 2024-05-08 21:01 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:
