Finding Cracks in the Wall of NP-completeness

Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph

Autori: Vasily Alferov, Ivan Bliznets, Kirill Brilliantov
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 38, 2024, Pagina/e 7918-7925, ISSN 2374-3468
Editore: AAAI presss
DOI: 10.1609/aaai.v38i8.28628

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan

Autori: Jesper Nederlof, Céline M. F. Swennenhuis
Pubblicato in: Algorithmica, Numero 84, 2022, Pagina/e 2309-2334, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-022-00970-8

Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces

Autori: Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
Pubblicato in: ACM Transactions on Algorithms, Numero 16/3, 2020, Pagina/e 1-30, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3371389

Isometric Universal Graphs

Autori: Louis Esperet, Cyril Gavoille, Carla Groenland
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 35/2, 2021, Pagina/e 1224-1237, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/21m1406155

Decomposing Random Permutations into Order-Isomorphic Subpermutations

Autori: Carla Groenland, Tom Johnston, Daniel Korandi, Alexander Roberts, Alex Scott, Jane Tan
Pubblicato in: SIAM Journal on Discrete Mathematics, Numero 37, 2023, Pagina/e 1252-1261, ISSN 0895-4801
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/22m148029x

Graphs of low average degree without independent transversals

Autori: Carla Groenland, Tomáš Kaiser, Oscar Treffers, Matthew Wales
Pubblicato in: Journal of Graph Theory, Numero 102, 2023, Pagina/e 374-387, ISSN 0364-9024
Editore: John Wiley & Sons Inc.
DOI: 10.1002/jgt.22876

Improved Algorithms for Maximum Satisfiability and Its Special Cases

Autori: Kirill Brilliantov, Vasily Alferov, Ivan Bliznets
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 37, 2023, Pagina/e 3898-3905, ISSN 2374-3468
Editore: AAAI press
DOI: 10.1609/aaai.v37i4.25503

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models

Autori: Jesper Nederlof, Michał Pilipczuk, Karol Węgrzycki
Pubblicato in: The Electronic Journal of Combinatorics, Numero 30, 2023, ISSN 1077-8926
Editore: Electronic Journal of Combinatorics
DOI: 10.37236/11095

Reconstructing the degree sequence of a sparse graph from a partial deck

Autori: Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex Scott, Jane Tan
Pubblicato in: Journal of Combinatorial Theory, Series B, Numero 157, 2024, Pagina/e 283-293, ISSN 0095-8956
Editore: Academic Press
DOI: 10.1016/j.jctb.2022.07.004

Approximating Pathwidth for Graphs of Small Treewidth

Autori: Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Pubblicato in: ACM Transactions on Algorithms, Numero 19, 2023, Pagina/e 1-19, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3576044

The lengths for which bicrucial square-free permutations exist

Autori: null null, Carla Groenland, Tom Johnston, null null
Pubblicato in: Enumerative Combinatorics and Applications, Numero 2, 2022, Pagina/e "Article #S4PP4", ISSN 2710-2335
Editore: Electronic
DOI: 10.54550/eca2022v2s4pp4

Fair division with minimal withheld information in social networks

Autori: Ivan Bliznets, Anton Bukov, Danil Sagunov
Pubblicato in: Theoretical Computer Science, Numero 991, 2024, Pagina/e 114446, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2024.114446

Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$

Autori: Ivan Bliznets, Danil Sagunov
Pubblicato in: Algorithmica, Numero 85, 2023, Pagina/e 384-405, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-022-01031-w

Tight Lower Bounds for Problems Parameterized by Rank-width

Autori: Bergougnoux, Benjamin; Korhonen, Tuukka; Nederlof, Jesper
Pubblicato in: Numero 11, 2023
Editore: LIPIcs
DOI: 10.48550/arxiv.2210.02117

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints

Autori: Nederlof, Jesper; Swennenhuis, Céline M. F.; Węgrzycki, Karol
Pubblicato in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Numero 1, 2025
Editore: SIAM
DOI: 10.48550/arxiv.2312.03495

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

Autori: Kisfaludi-Bak, S.; Nederlof, J.; Węgrzycki, K.
Pubblicato in: Crossref, Numero 5, 2021
Editore: IEEE
DOI: 10.48550/arxiv.2011.03778

On the Complexity of Problems on Tree-structured Graphs

Autori: Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo; Pilipczuk, Marcin; Pilipczuk, Michał
Pubblicato in: Numero 32, 2022
Editore: LIPICS
DOI: 10.48550/arxiv.2206.11828

Enumeration of Minimal Tropical Connected Sets

Autori: Ivan Bliznets; Danil Sagunov; Eugene Tagin
Pubblicato in: Algorithms and Complexity - 13th International Conference (CIAC), 2023
Editore: Springer

On the parameterized complexity of computing tree-partitions

Autori: Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo
Pubblicato in: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Numero 14, 2022
Editore: LIPICS
DOI: 10.48550/arxiv.2206.11832

A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth

Autori: Mannens, Isja; Nederlof, Jesper
Pubblicato in: 31st Annual European Symposium on Algorithms, ESA 2023, Numero 3, 2023
Editore: LIPICS
DOI: 10.48550/arxiv.2307.01046

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a Rooted K_4-Minor

Autori: Carla Groenland, Jesper Nederlof, Tomohiro Koana
Pubblicato in: 19th International Symposium on Parameterized and Exact Computation, 2024
Editore: LIPICS

Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron

Autori: Paul Bastide, Carla Groenland, Hugo Jacob, Tom Johnston
Pubblicato in: Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023, Pagina/e 120-126
Editore: Masaryk University Press
DOI: 10.5817/cz.muni.eurocomb23-017

Isolation Schemes for Problems on Decomposable Graphs

Autori: Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Pubblicato in: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Numero 33, 2022
Editore: LIPICS

XNLP-hardness of Parameterized Problems on Planar Graphs

Autori: Bodlaender, Hans L.; Szilágyi, Krisztina
Pubblicato in: 19th International Symposium on Parameterized and Exact Computation, Numero 1, 2024
Editore: LIPICS
DOI: 10.48550/arxiv.2402.03087

Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors

Autori: Jesper Nederlof, Karol Węgrzycki
Pubblicato in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Pagina/e 1670-1683, ISBN 9781450380539
Editore: ACM
DOI: 10.1145/3406325.3451024

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters

Autori: Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
Pubblicato in: 51st International Colloquium on Automata, Languages, and Programming, 2024
Editore: LIPICS
DOI: 10.4230/lipics.icalp.2024.77

Tight bounds for counting colorings and connected edge sets parameterized by cutwidth

Autori: Groenland, Carla; Mannens, Isja; Nederlof, Jesper; Szilágyi, Krisztina
Pubblicato in: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Numero 1, 2022
Editore: LIPCS
DOI: 10.48550/arxiv.2110.02730

Parameterized Complexities of Dominating and Independent Set Reconfiguration

Autori: Bodlaender, Hans L.; Groenland, Carla; Swennenhuis, Céline M.F.; Golovach, Petr A.; Zehavi, Meirav; Sub Algorithms and Complexity; Algorithms and Complexity
Pubblicato in: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Numero 1, 2021
Editore: LIPICS
DOI: 10.4230/lipics.ipec.2021.9

Detecting and counting small patterns in planar graphs in subexponential parameterized time

Autori: Jesper Nederlof
Pubblicato in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Pagina/e 1293-1306, ISBN 9781450369794
Editore: ACM
DOI: 10.1145/3357713.3384261

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs

Autori: Björklund, Andreas; Kaski, Petteri; Nederlof, Jesper
Pubblicato in: 51st International Colloquium on Automata, Languages, and Programming, Numero 5, 2024
Editore: LIPICS
DOI: 10.48550/arxiv.2308.01574

MaxCut Above Guarantee

Autori: Ivan Bliznets; Vladislav Epifanov
Pubblicato in: 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Editore: LIPICS

Polynomial-time Approximation of Independent Set Parameterized by Treewidth

Autori: Chalermsook, Parinya; Fomin, Fedor V.; Hamm, Thekla; Korhonen, Tuukka; Nederlof, Jesper; Orgo, Ly
Pubblicato in: In 31st Annual European Symposium on Algorithms, Numero 18, 2023
Editore: LIPICS
DOI: 10.48550/arxiv.2307.01341

XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure

Autori: Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo; Jaffke, Lars; Lima, Paloma T.
Pubblicato in: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), Numero 4, 2022
Editore: LIPICS
DOI: 10.48550/arxiv.2201.13119

Faster Algorithms on Linear Delta-Matroids

Autori: Tomohiro Koana, Magnus Wahlström
Pubblicato in: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 2025
Editore: LIPICS
DOI: 10.4230/lipics.stacs.2025.62

Faster Edge Coloring by Partition Sieving

Autori: Shyan Akmal, Tomohiro Koana
Pubblicato in: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 2025
Editore: LIPICS
DOI: 10.4230/lipics.stacs.2025.7

Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication

Autori: Jesper Nederlof
Pubblicato in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Pagina/e 40-53, ISBN 9781450369794
Editore: ACM
DOI: 10.1145/3357713.3384264

List Colouring Trees in Logarithmic Space

Autori: Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo
Pubblicato in: 30th Annual European Symposium on Algorithms (ESA 2022), Numero 2, 2022
Editore: LIPICS
DOI: 10.48550/arxiv.2206.09750

The Parameterised Complexity of Integer Multicommodity Flow

Autori: Mannens, Isja; Oostveen, Jelle; van Leeuwen, Erik Jan; Pandey, Sukanya; Bodlaender, Hans L.
Pubblicato in: 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), Numero 4, 2023
Editore: LIPICS
DOI: 10.48550/arxiv.2310.05784

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

Autori: Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Węgrzycki
Pubblicato in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Pagina/e 1682-1701, ISBN 978-1-61197-646-5
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.102

Tight Double Exponential Lower Bounds

Autori: Ivan Bliznets, Markus Hecher
Pubblicato in: Lecture Notes in Computer Science, Theory and Applications of Models of Computation, 2024, Pagina/e 124-136
Editore: Springer Nature Singapore
DOI: 10.1007/978-981-97-2340-9_11

Parameterized Algorithms for Covering by Arithmetic Progressions

Autori: Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
Pubblicato in: Lecture Notes in Computer Science, SOFSEM 2024: Theory and Practice of Computer Science, 2024, Pagina/e 125-138
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-52113-3_9

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

Autori: Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, Karol Węgrzycki
Pubblicato in: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers, Numero 12301, 2020, Pagina/e 27-39, ISBN 978-3-030-60439-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-60440-0_3

Exact and Parameterized Algorithms for Choosability

Autori: Ivan Bliznets, Jesper Nederlof
Pubblicato in: Lecture Notes in Computer Science, SOFSEM 2024: Theory and Practice of Computer Science, 2024, Pagina/e 111-124
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-52113-3_8

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs

Autori: Jesper Nederlof, Krisztina Szilágyi
Pubblicato in: Lecture Notes in Computer Science, SOFSEM 2024: Theory and Practice of Computer Science, 2024, Pagina/e 413-426
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-52113-3_29

Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices

Autori: Jesper Nederlof
Pubblicato in: Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, Numero 12160, 2020, Pagina/e 145-164, ISBN 978-3-030-42070-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-42071-0_11

On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

Autori: Isja Mannens, Jesper Nederlof, Céline Swennenhuis, Krisztina Szilágyi
Pubblicato in: Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, Numero 12911, 2021, Pagina/e 52-79, ISBN 978-3-030-86837-6
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-86838-3_5

A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs

Autori: Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek
Pubblicato in: 35th International Symposium on Distributed Computing (DISC 2021), Numero 35, 2020, ISBN 978-3-95977-210-5
Editore: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.disc.2021.13

On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan

Autori: Nederlof, Jesper ; Swennenhuis, Céline M. F.
Pubblicato in: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020, Pagina/e 25:1--25:17, ISBN 978-3-95977-172-6
Editore: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.ipec.2020.25

Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space

Autori: Bodlaender, Hans L.; Groenland, Carla; Nederlof, Jesper; Swennenhuis, Celine M.F.; Sub Algorithms and Complexity; Dep Wiskunde; Sub Mathematical Modeling; Algorithms and Complexity
Pubblicato in: Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021, Numero 2, 2021
Editore: IEEE
DOI: 10.1109/focs52979.2021.00027

Fair Division with Minimal Withheld Information in Social Networks

Autori: Ivan Bliznets, Anton Bukov, Danil Sagunov
Pubblicato in: Lecture Notes in Computer Science, Computing and Combinatorics, 2023, Pagina/e 126-137
Editore: Springer International Publishing
DOI: 10.1007/978-3-031-22105-7_12

Perfect shuffling with fewer lazy transpositions

Autori: Groenland, Carla; Johnston, Tom; Radcliffe, Jamie; Scott, Alex
Pubblicato in: arxiv, Numero 1, 2022
Editore: corr
DOI: 10.48550/arxiv.2208.06629

Pubblicazioni

Condividi questa pagina Condividi questa pagina sui social network

Scarica Scarica il contenuto della pagina