Publikacje

Czasopismo: JOURNAL OF THE ACM

Liczba publikacji: 17

2025

• Marvin Künnemann, Filip Mazowiecki , Lia Schütze, Henry Sinclair-Banks , Karol Węgrzycki, Coverability in VASS Revisited: Improving Rackoff’s Bounds to Obtain Conditional Optimality, JOURNAL OF THE ACM, 2025. Zobacz w PBN
• Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk , Magnus Wahlström, Flow-augmentation I: Directed graphs, JOURNAL OF THE ACM, 72 (1) 2025, s. 1-38. Zobacz w PBN
• Arka Ghosh , Piotr Hofman , Sławomir Lasota , Orbit-finite Linear Programming, JOURNAL OF THE ACM, 72 (1) 2025, s. 1-39. Zobacz w PBN

2024

• Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Toruńczyk , Twin-Width IV: Ordered Graphs and Matrices, JOURNAL OF THE ACM, 71 (3) 2024, s. 1-45. Zobacz w PBN

2023

• Miguel Romero, Marcin Wrochna , Stanislav Živný, Pliability and Approximating Max-CSPs, JOURNAL OF THE ACM, 70 (6) 2023, s. 1-43. Zobacz w PBN

2021

• Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski , Florian Sikora, Stéphan Thomassé, EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs, JOURNAL OF THE ACM, 68 (2) 2021, s. 1-38. Zobacz w PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić, JÉrôme Leroux, Filip Mazowiecki , The Reachability Problem for Petri Nets Is Not Elementary, JOURNAL OF THE ACM, 68 (1) 2021, s. 1-28. Zobacz w PBN

2018

• Marek Cygan , Stefan Kratsch, Jesper Nederlof, Fast Hamiltonicity Checking Via Bases of Perfect Matchings, JOURNAL OF THE ACM, 46 (3) 2018, s. 1-46. Zobacz w PBN
• Wojciech Czerwiński , Wim Martens, Matthias Niewerth, Paweł Parys , Minimization of Tree Patterns, JOURNAL OF THE ACM, 65 (4) 2018, s. 26:1-26:46. Zobacz w PBN
• Stefan Dziembowski , Krzysztof Pietrzak, Daniel Wichs, Non-Malleable Codes, JOURNAL OF THE ACM, 65 (4) 2018, s. 1-32. Zobacz w PBN

2017

• Marek Cygan , Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socała, Tight Lower Bounds on Graph Embedding Problems, JOURNAL OF THE ACM, 64 (3) 2017, s. 1-22. Zobacz w PBN

2015

• Marek Cygan , Harold N. Gabow, Piotr Sankowski , Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings, JOURNAL OF THE ACM, 2015. Zobacz w PBN

2014

• Filip Murlak , Shun'ichi Amano, Claire David, Leonid Libkin, XML Schema Mappings: Data Exchange and Metadata Management, JOURNAL OF THE ACM, 61 (2) 2014, s. 12-12. Zobacz w PBN

2011

• Mikołaj Bojańczyk , Paweł Parys , XPath Evaluation in Linear Time, JOURNAL OF THE ACM, 2011. Zobacz w PBN

2009

• Mikołaj Bojańczyk , Anca Muscholl, Thomas Schwentick, Luc Segoufin, Two-variable logic on data trees and XML reasoning, JOURNAL OF THE ACM, 2009. Zobacz w PBN

2004

• Wojciech Plandowski , Satisfiability of word equations with constants is in PSPACE, JOURNAL OF THE ACM, 2004. Zobacz w PBN

2000

• J Karhumaki, F Mignosi, Wojciech Plandowski , The expressibility of languages and relations by word equations, JOURNAL OF THE ACM, 2000. Zobacz w PBN