default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Wrochna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j20]Miguel Romero
, Marcin Wrochna, Stanislav Zivný:
Pliability and Approximating Max-CSPs. J. ACM 70(6): 41:1-41:43 (2023)- [j19]Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný:
Topology and Adjunction in Promise Constraint Satisfaction. SIAM J. Comput. 52(1): 38-79 (2023) - [j18]Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný:
PTAS for Sparse General-valued CSPs. ACM Trans. Algorithms 19(2): 14:1-14:31 (2023) - 2021
- [j17]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. 35(1): 105-151 (2021) - [j16]Alex Brandts, Marcin Wrochna, Stanislav Zivný:
The Complexity of Promise SAT on Non-Boolean Domains. ACM Trans. Comput. Theory 13(4): 26:1-26:20 (2021) - 2020
- [j15]Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný:
The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems. SIAM J. Comput. 49(6): 1232-1248 (2020) - [j14]Marcin Wrochna:
Homomorphism Reconfiguration via Homotopy. SIAM J. Discret. Math. 34(1): 328-350 (2020) - [j13]Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. ACM Trans. Comput. Theory 12(3): 19:1-19:19 (2020) - 2019
- [j12]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica 81(2): 557-588 (2019) - [j11]Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization Faster than $$2^k$$ 2 k. Algorithmica 81(3): 917-966 (2019) - [j10]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Algorithmica 81(10): 3936-3967 (2019) - [j9]Marcin Wrochna:
On inverse powers of graphs and topological implications of Hedetniemi's conjecture. J. Comb. Theory B 139: 267-295 (2019) - [j8]Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna:
The step Sidorenko property and non-norming edge-transitive graphs. J. Comb. Theory A 162: 34-54 (2019) - [j7]Claude Tardif, Marcin Wrochna:
Hedetniemi's Conjecture and Strongly Multiplicative Graphs. SIAM J. Discret. Math. 33(4): 2218-2250 (2019) - [j6]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory 11(3): 13:1-13:19 (2019) - 2018
- [j5]Marcin Wrochna:
Reconfiguration in bounded bandwidth and tree-depth. J. Comput. Syst. Sci. 93: 1-10 (2018) - [j4]Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk, Marcin Wrochna:
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms 14(3): 34:1-34:45 (2018) - [j3]Michal Pilipczuk, Marcin Wrochna:
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. ACM Trans. Comput. Theory 9(4): 18:1-18:36 (2018) - 2017
- [j2]Marcin Wrochna:
Square-free graphs are multiplicative. J. Comb. Theory B 122: 479-507 (2017) - [j1]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. Theory Comput. Syst. 60(4): 615-636 (2017)
Conference and Workshop Papers
- 2021
- [c19]Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný:
PTAS for Sparse General-Valued CSPs. LICS 2021: 1-11 - [c18]Miguel Romero, Marcin Wrochna, Stanislav Zivný:
Treewidth-Pliability and PTAS for Max-CSPs. SODA 2021: 473-483 - 2020
- [c17]Alex Brandts, Marcin Wrochna, Stanislav Zivný:
The Complexity of Promise SAT on Non-Boolean Domains. ICALP 2020: 17:1-17:13 - [c16]Marcin Wrochna:
PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions. IPEC 2020: 36:1-36:4 - [c15]Marcin Wrochna, Stanislav Zivný:
Improved hardness for H-colourings of G-colourable graphs. SODA 2020: 1426-1435 - 2019
- [c14]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. IPCO 2019: 194-204 - [c13]Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. STACS 2019: 44:1-44:15 - 2018
- [c12]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set Parameterized by Treewidth. WG 2018: 65-78 - 2017
- [c11]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. ESA 2017: 18:1-18:14 - [c10]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP 2017: 57:1-57:15 - [c9]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. IPEC 2017: 23:1-23:13 - [c8]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA 2017: 1419-1432 - 2016
- [c7]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. IPEC 2016: 15:1-15:13 - [c6]Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization Faster Than 2^k. IPEC 2016: 26:1-26:13 - [c5]Michal Pilipczuk, Marcin Wrochna:
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. STACS 2016: 57:1-57:15 - 2015
- [c4]Marcin Wrochna:
Homomorphism Reconfiguration via Homotopy. STACS 2015: 730-742 - [c3]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. WG 2015: 440-455 - 2014
- [c2]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna:
Reconfiguration over Tree Decompositions. IPEC 2014: 246-257 - [c1]Paul S. Bonsma, Marcin Kaminski, Marcin Wrochna:
Reconfiguring Independent Sets in Claw-Free Graphs. SWAT 2014: 86-97
Informal and Other Publications
- 2022
- [i24]Marcin Wrochna:
A note on hardness of promise hypergraph colouring. CoRR abs/2205.14719 (2022) - 2020
- [i23]Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný:
Topology and adjunction in promise constraint satisfaction. CoRR abs/2003.11351 (2020) - [i22]Marcin Wrochna:
Sallow: a heuristic algorithm for treedepth decompositions. CoRR abs/2006.07050 (2020) - [i21]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. CoRR abs/2012.00079 (2020) - [i20]Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný:
PTAS for Sparse General-Valued CSPs. CoRR abs/2012.12607 (2020) - [i19]Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, Stanislav Zivný:
The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i18]Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný:
Topology and adjunction in promise constraint satisfaction. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i17]Marcin Wrochna, Stanislav Zivný:
Improved hardness for H-colourings of G-colourable graphs. CoRR abs/1907.00872 (2019) - [i16]Miguel Romero, Marcin Wrochna, Stanislav Zivný:
Treewidth-Pliability and PTAS for Max-CSPs. CoRR abs/1911.03204 (2019) - [i15]Alex Brandts, Marcin Wrochna, Stanislav Zivný:
The complexity of promise SAT on non-Boolean domains. CoRR abs/1911.09065 (2019) - 2018
- [i14]Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight complexity lower bounds for integer linear programming with few constraints. CoRR abs/1811.01296 (2018) - 2017
- [i13]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set parameterized by treewidth. CoRR abs/1707.01470 (2017) - [i12]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. CoRR abs/1707.01797 (2017) - 2016
- [i11]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: obstructions and algorithmic aspects. CoRR abs/1606.05975 (2016) - [i10]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight lower bounds for the complexity of multicoloring. CoRR abs/1607.03432 (2016) - [i9]Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna:
Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR abs/1609.07780 (2016) - 2015
- [i8]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial kernelization for removing induced claws and diamonds. CoRR abs/1503.00704 (2015) - [i7]Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization faster than 2k. CoRR abs/1507.02168 (2015) - [i6]Michal Pilipczuk, Marcin Wrochna:
On space efficiency of algorithms working on structural decompositions of graphs. CoRR abs/1509.05896 (2015) - [i5]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR abs/1511.01379 (2015) - 2014
- [i4]Paul S. Bonsma, Marcin Kaminski, Marcin Wrochna:
Reconfiguring Independent Sets in Claw-Free Graphs. CoRR abs/1403.0359 (2014) - [i3]Marcin Wrochna:
Reconfiguration in bounded bandwidth and treedepth. CoRR abs/1405.0847 (2014) - [i2]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna:
Reconfiguration over tree decompositions. CoRR abs/1405.2447 (2014) - [i1]Marcin Wrochna:
Homomorphism reconfiguration via homotopy. CoRR abs/1408.2812 (2014)
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-06-10 21:22 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:
