Marek Cygan

Mateusz Ostaszewski

CoRR, 2024

Polite Teacher: Semi-Supervised Instance Segmentation With Mutual Learning and Pseudo-Label Thresholding.

[BibT_eX]

[DOI]

IEEE Access, 2024

Overestimation, Overfitting, and Plasticity in Actor-Critic: the Bitter Lesson of Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Scaling Laws for Fine-Grained Mixture of Experts.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Decoupled Actor-Critic.

[BibT_eX]

[DOI]

CoRR, 2023

Mixture of Tokens: Efficient LLMs through Cross-Example Aggregation.

[BibT_eX]

[DOI]

CoRR, 2023

Grasping Student: semi-supervised learning for robotic manipulation.

[BibT_eX]

[DOI]

CoRR, 2023

On Many-Actions Policy Gradient.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

2022

Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020).

[BibT_eX]

[DOI]

Arkadev Chattopadhyay

Noga Ron-Zewi

Christian Wulff-Nilsen

SIAM J. Comput., June, 2022

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.

[BibT_eX]

[DOI]

Johan M. M. van Rooij

ACM Trans. Algorithms, 2022

On All-Action Policy Gradients.

[BibT_eX]

[DOI]

CoRR, 2022

One Simple Trick to Fix Your Bayesian Neural Network.

[BibT_eX]

[DOI]

Piotr Tempczyk

Ksawery Smoczynski

Philip Smolenski-Jensen

CoRR, 2022

2021

Randomized Contractions Meet Lean Decompositions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

n-CPS: Generalising Cross Pseudo Supervision to n networks for Semi-Supervised Semantic Segmentation.

[BibT_eX]

[DOI]

Dominik Filipiak

Piotr Tempczyk

CoRR, 2021

Minimum Common String Partition: Exact Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Guy Kortsarz

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

2019

On Problems Equivalent to (min, +)-Convolution.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Improving TSP Tours Using Dynamic Programming over Tree Decompositions.

[BibT_eX]

[DOI]

Arkadiusz Socala

ACM Trans. Algorithms, 2019

Minimum Bisection Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

2018

Hardness of Approximation for H-free Edge Modification Problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2018

Approximation and Parameterized Complexity of Minimax Approval Voting.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Fast Hamiltonicity Checking Via Bases of Perfect Matchings.

[BibT_eX]

[DOI]

Stefan Kratsch

Jesper Nederlof

J. ACM, 2018

On subexponential running times for approximating directed Steiner tree and related problems.

[BibT_eX]

[DOI]

Guy Kortsarz

Bundit Laekhanukit

CoRR, 2018

Randomized contractions meet lean decompositions.

[BibT_eX]

[DOI]

CoRR, 2018

Improved GQ-CNN: Deep Learning Model for Planning Robust Grasps.

[BibT_eX]

[DOI]

CoRR, 2018

Online Facility Location with Deletions.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy.

[BibT_eX]

[DOI]

Danny Hermelin

ACM Trans. Algorithms, 2017

Polynomial Kernelization for Removing Induced Claws and Diamonds.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Tight Lower Bounds on Graph Embedding Problems.

[BibT_eX]

[DOI]

J. ACM, 2017

Hitting forbidden subgraphs in graphs of bounded treewidth.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Randomization in Parameterized Complexity (Dagstuhl Seminar 17041).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Improving TSP tours using dynamic programming over tree decomposition.

[BibT_eX]

[DOI]

Arkadiusz Socala

CoRR, 2017

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Randomized Contraction.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Exact Algorithms for Bandwidth.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

On Problems as Hard as CNF-SAT.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Known Algorithms for Edge Clique Cover are Probably Optimal.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Designing FPT Algorithms for Cut Problems Using Randomized Contractions.

[BibT_eX]

[DOI]

Rajesh Chitnis

MohammadTaghi Hajiaghayi

SIAM J. Comput., 2016

Online Knapsack Revisited.

[BibT_eX]

[DOI]

Lukasz Jez

Jirí Sgall

Theory Comput. Syst., 2016

A Fast Branching Algorithm for Cluster Vertex Deletion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Polynomial-time approximation algorithms for weighted LCS problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

On Group Feedback Vertex Set Parameterized by the Size of the Cutset.

[BibT_eX]

[DOI]

Algorithmica, 2016

Erratum to: Foreword: Special Issue on IPEC 2014.

[BibT_eX]

[DOI]

Pinar Heggernes

Algorithmica, 2016

Foreword: Special Issue on IPEC 2014.

[BibT_eX]

[DOI]

Pinar Heggernes

Algorithmica, 2016

Lower Bounds for Approximation Schemes for Closest String.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Online Pricing with Impatient Bidders.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Tight Bounds for Graph Homomorphism and Subgraph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Algorithmic Complexity of Power Law Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Hardness of Approximation for H-Free Edge Modification Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2016

2015

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

Mohammad Taghi Hajiaghayi

Dániel Marx

ACM Trans. Algorithms, 2015

Sitting Closer to Friends than Enemies, Revisited.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings.

[BibT_eX]

[DOI]

Harold N. Gabow

Piotr Sankowski

J. ACM, 2015

Kernelization lower bound for Permutation Pattern Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Faster exponential-time algorithms in graphs of bounded average degree.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth.

[BibT_eX]

[DOI]

Inf. Comput., 2015

The Hardness of Subgraph Isomorphism.

[BibT_eX]

[DOI]

Jakub Pachocki

Arkadiusz Socala

CoRR, 2015

Approximating Upper Degree-Constrained Partial Orientations.

[BibT_eX]

[DOI]

Tomasz Kociumaka

Proceedings of the Approximation, 2015

Parameterized Algorithms

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-319-21275-3, 2015

2014

Clique Cover and Graph Separation: New Incompressibility Results.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2014

On the Hardness of Losing Width.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Parameterized complexity of firefighting.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n.

[BibT_eX]

[DOI]

Algorithmica, 2014

Scheduling Partially Ordered Jobs Faster than 2 n.

[BibT_eX]

[DOI]

Algorithmica, 2014

Parameterized Complexity of Eulerian Deletion Problems.

[BibT_eX]

[DOI]

Algorithmica, 2014

On Cutwidth Parameterized by Vertex Cover.

[BibT_eX]

[DOI]

Algorithmica, 2014

Constant Factor Approximation for Capacitated k-Center with Outliers.

[BibT_eX]

[DOI]

Tomasz Kociumaka

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013

On multiway cut parameterized above lower bounds.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2013

Subset Feedback Vertex Set Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Steiner Forest Orientation Problems.

[BibT_eX]

[DOI]

Guy Kortsarz

Zeev Nutov

SIAM J. Discret. Math., 2013

Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

A bound on the number of perfect matchings in Klee-graphs.

[BibT_eX]

[DOI]

Riste Skrekovski

Discret. Math. Theor. Comput. Sci., 2013

Online Knapsack Revisited.

[BibT_eX]

[DOI]

Lukasz Jez

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

On Pairwise Spanners.

[BibT_eX]

[DOI]

Telikepalli Kavitha

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

How to Sell Hyperedges: The Hypermatching Assignment Problem.

[BibT_eX]

[DOI]

Monaldo Mastrolilli

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Catch them if you can: how to serve impatient users.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract).

[BibT_eX]

[DOI]

Danny Hermelin

Proceedings of the Algorithms - ESA 2013, 2013

2012

Even Faster Exact Bandwidth.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More).

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

A Planar linear arboricity conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Kernelization hardness of connectivity problems in d-degenerate graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Bandwidth and distortion revisited.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time

[BibT_eX]

[DOI]

CoRR, 2012

On fixed-parameter algorithms for Split Vertex Deletion

[BibT_eX]

[DOI]

CoRR, 2012

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2012

Deterministic Parameterized Connected Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

LP Rounding for k-Centers with Non-uniform Hard Capacities.

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

Samir Khuller

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Dominating set is fixed parameter tractable in claw-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Breaking the 2n-barrier for Irredundance: Two lines of attack.

[BibT_eX]

[DOI]

Daniel Binkele-Raible

J. Discrete Algorithms, 2011

Capacitated domination faster than O(n2).

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Channel assignment via fast zeta transform.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

On Problems as Hard as CNFSAT

[BibT_eX]

[DOI]

CoRR, 2011

The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Parameterized Complexity of Firefighting Revisited.

[BibT_eX]

[DOI]

Fedor V. Fomin

Erik Jan van Leeuwen

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Approximation Algorithms for Union and Intersection Covering Problems.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Exact and approximate bandwidth.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Capacitated Domination Faster Than O(2n).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Fast Approximation in Subspaces by Doubling Metric Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

Algorithms for Three Versions of the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Irredundant Set Faster Than O(2n).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

A Planar Linear Arboricity Conjecture.

[BibT_eX]

[DOI]

Borut Luzar

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Exponential-time approximation of weighted set cover.

[BibT_eX]

[DOI]

Mateusz Wykurz

Inf. Process. Lett., 2009

Beyond O*(2^n) in domination-type problems

[BibT_eX]

[DOI]

CoRR, 2009

2008

Exponential-Time Approximation of Hard Problems

[BibT_eX]

[DOI]

CoRR, 2008

Faster Exact Bandwidth.

[BibT_eX]

[DOI]