Meirav Zehavi

J. Comput. Syst. Sci., 2025

Min-Sum Disjoint Paths on Subclasses of Chordal Graphs.

[BibT_eX]

[DOI]

Bar Menashe

Proceedings of the WALCOM: Algorithms and Computation, 2025

Crossing Number in Slightly Superexponential Time (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Parameterized Geometric Graph Modification with Disk Scaling.

[BibT_eX]

[DOI]

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

(Re)packing Equal Disks into Rectangle.

[BibT_eX]

[DOI]

Discret. Comput. Geom., December, 2024

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2024

The Parameterized Complexity of Guarding Almost Convex Polygons.

[BibT_eX]

[DOI]

Kristine V. K. Knudsen

Daniel Lokshtanov

Discret. Comput. Geom., March, 2024

Long directed detours: Reduction to 2-Disjoint Paths.

[BibT_eX]

[DOI]

Ashwin Jacob

Inf. Process. Lett., 2024

Adaptive Manipulation for Coalitions in Knockout Tournaments.

[BibT_eX]

[DOI]

CoRR, 2024

Maximum Partial List H-Coloring on P5-free graphs in polynomial time.

[BibT_eX]

[DOI]

CoRR, 2024

Subexponential Parameterized Algorithms for Hitting Subgraphs.

[BibT_eX]

[DOI]

CoRR, 2024

Meta-theorems for Parameterized Streaming Algorithms‡.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Exact Algorithms for Clustered Planarity with Linear Saturators.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees.

[BibT_eX]

[DOI]

Ashwin Jacob

Diptapriyo Majumdar

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Kernelization of Counting Problems.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Parameterized Analysis of Bribery in Challenge the Champ Tournaments.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

Hybrid k-Clustering: Blending k-Median and k-Center.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

How to Make Knockout Tournaments More Popular?

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

New algorithms for structure informed genome rearrangement.

[BibT_eX]

[DOI]

Eden Ozeri

Michal Ziv-Ukelson

Algorithms Mol. Biol., December, 2023

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

Polynomial Kernel for Interval Vertex Deletion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2023

Erdős-Pósa property of obstructions to interval graphs.

[BibT_eX]

[DOI]

J. Graph Theory, April, 2023

Forgetfulness Can Make You Faster: An O*(8.097k)-time Algorithm for Weighted 3-set k-packing.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2023

Parameterized complexity of multi-node hubs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2023

Grid recognition: Classical and parameterized computational perspectives.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2023

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162).

[BibT_eX]

[DOI]

Robert Ganian

Fabrizio Montecchiani

Martin Nöllenburg

Liana Khazaliya

Dagstuhl Reports, 2023

P-matchings Parameterized by Treewidth.

[BibT_eX]

[DOI]

CoRR, 2023

Parameterized Analysis of the Cops and Robber Problem.

[BibT_eX]

[DOI]

CoRR, 2023

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Parameterized Study of Steiner Tree on Unit Disk Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2023

P-Matchings Parameterized by Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

An ETH-Tight Algorithm for Bidirected Steiner Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Parameterized Approaches to Orthogonal Compaction.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

A Framework for Approximation Schemes on Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Analysis of the Cops and Robber Game.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Sidestepping Barriers for Dominating Set in Parameterized Complexity.

[BibT_eX]

[DOI]

Ioannis Koutis

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Drawn Tree Decomposition: New Approach for Graph Drawing Problems.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Collective Graph Exploration Parameterized by Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

On Computing Homological Hitting Sets.

[BibT_eX]

[DOI]

Ulrich Bauer

Abhishek Rathod

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?

[BibT_eX]

[DOI]

Pascal Kunz

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Parameterized Complexity of Incomplete Connected Fair Division.

[BibT_eX]

[DOI]

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Planar Disjoint Paths, Treewidth, and Kernels.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large.

[BibT_eX]

[DOI]

Ashwin Jacob

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Lossy Kernelization for (Implicit) Hitting Set Problems.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Kernelization for Spreading Points.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Resolute control: Forbidding candidates from winning an election is hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization).

[BibT_eX]

[DOI]

Sushmita Gupta

SIAM J. Discret. Math., 2022

Parameterized analysis and crossing minimization problems.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2022

Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation.

[BibT_eX]

[DOI]

Petr A. Golovach

Algorithmica, 2022

Parameter Analysis for Guarding Terrains.

[BibT_eX]

[DOI]

Sudeshna Kolay

Algorithmica, 2022

Verification of multi-layered assignment problems.

[BibT_eX]

[DOI]

Barak Steindl

Auton. Agents Multi Agent Syst., 2022

New Algorithms for Structure Informed Genome Rearrangement.

[BibT_eX]

[DOI]

Eden Ozery

Michal Ziv-Ukelson

Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Parameterized Analysis for the Group Activity Selection Problem on Graphs.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

(Re)packing Equal Disks into Rectangle.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Multiplicative Parameterization Above a Guarantee.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2021

Balanced stable marriage: How close is close enough?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

r-Simple k-Path and Related Problems Parameterized by k/r.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Magnus Wahlström

ACM Trans. Algorithms, 2021

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).

[BibT_eX]

[DOI]

Robert Ganian

Fabrizio Montecchiani

Martin Nöllenburg

Dagstuhl Reports, 2021

The complexity of high-dimensional cuts.

[BibT_eX]

[DOI]

Ulrich Bauer

Abhishek Rathod

CoRR, 2021

Approximate search for known gene clusters in new genomes using PQ-trees.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2021

A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs.

[BibT_eX]

[DOI]

Roohani Sharma

Algorithmica, 2021

Packing Arc-Disjoint Cycles in Tournaments.

[BibT_eX]

[DOI]

Algorithmica, 2021

Simultaneous Feedback Edge Set: A Parameterized Perspective.

[BibT_eX]

[DOI]

Algorithmica, 2021

Exploiting Dense Structures in Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version).

[BibT_eX]

[DOI]

Daniel Lokshtanov

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

FPT-approximation for FPT Problems.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Participatory Budgeting with Project Groups.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Parameterized Analysis of Assignment Under Multiple Preferences.

[BibT_eX]

[DOI]

Barak Steindl

Proceedings of the Multi-Agent Systems - 18th European Conference, 2021

Multivariate Analysis of Scheduling Fair Competitions.

[BibT_eX]

[DOI]

Mateus de Oliveira Oliveira

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping.

[BibT_eX]

[DOI]

Christian Komusiewicz

Theor. Comput. Sci., 2020

A Note on GRegNetSim: A Tool for the Discrete Simulation and Analysis of Genetic Regulatory Networks.

[BibT_eX]

[DOI]

Dor Ganor

IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Going Far from Degeneracy.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation.

[BibT_eX]

[DOI]

Roni Zoller

Michal Ziv-Ukelson

J. Comput. Biol., 2020

The Parameterized Complexity of Motion Planning for Snake-Like Robots.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2020

Popular Matching in Roommates Setting is NP-hard.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors.

[BibT_eX]

[DOI]

Neeldhara Misra

Frances A. Rosamond

Algorithms, 2020

Quadratic Vertex Kernel for Rainbow Matching.

[BibT_eX]

[DOI]

Algorithmica, 2020

Gehrlein stability in committee selection: parameterized hardness and algorithms.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2020

An exponential time parameterized algorithm for planar disjoint paths.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Hitting topological minors is FPT.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Fault Tolerant Subgraphs with Applications in Kernelization.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Parameterization Above a Multiplicative Guarantee.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

On the (Parameterized) Complexity of Almost Stable Marriage.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Parameterized Analysis of Art Gallery and Terrain Guarding.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2020

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

Parameterized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019

Split Contraction: The Untold Story.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

The parameterized complexity landscape of finding 2-partitions of digraphs.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Kristine Vitting Klinkby

Theor. Comput. Sci., 2019

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Rank Vertex Cover as a Natural Problem for Algebraic Compression.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Balanced Judicious Bipartition is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Packing Cycles Faster Than Erdos-Posa.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

A Brief Note on Single Source Fault Tolerant Reachability.

[BibT_eX]

[DOI]

CoRR, 2019

Reducing Topological Minor Containment to the Unique Linkage Theorem.

[BibT_eX]

[DOI]

CoRR, 2019

Improved Parameterized Algorithms for Network Query Problems.

[BibT_eX]

[DOI]

Algorithmica, 2019

Parameterized Algorithms for List K-Cycle.

[BibT_eX]

[DOI]

Algorithmica, 2019

The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.

[BibT_eX]

[DOI]

Algorithmica, 2019

Parameterized Algorithms and Kernels for Rainbow Matching.

[BibT_eX]

[DOI]

Algorithmica, 2019

Stability in barter exchange markets.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2019

Parameterized Computational Geometry via Decomposition Theorems.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On r-Simple k-Path and Related Problems Parameterized by k/r.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Magnus Wahlström

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Interval Vertex Deletion Admits a Polynomial Kernel.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

On Succinct Encodings for the Tournament Fixing Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Decomposition of Map Graphs with Applications.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximate Counting of k-Paths: Deterministic and in Polynomial Space.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Connecting the Dots (with Minimum Crossings).

[BibT_eX]

[DOI]

Grzegorz Guspiel

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Parameterized algorithms for stable matching with ties and incomplete lists.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Exact Algorithms for Terrain Guarding.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Matrix Rigidity from the Viewpoint of Parameterized Complexity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Parameterised Algorithms for Deletion to Classes of DAGs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Kernels for deletion to classes of acyclic digraphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

Long directed (s, t)-path: FPT algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

The k-leaf spanning tree problem admits a klam value of 39.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments.

[BibT_eX]

[DOI]

CoRR, 2018

$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel.

[BibT_eX]

[DOI]

Algorithmica, 2018

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Manu Basavaraju

Kristine Vitting Klinkby

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Winning a Tournament by Any Means Necessary.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

When Rigging a Tournament, Let Greediness Blind You.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Reducing CMSO Model Checking to Highly Connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Max-Cut Above Spanning Tree is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2018

2017

Maximum Minimal Vertex Cover Parameterized by Vertex Cover.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Spotting Trees with Few Leaves.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Parameterized Algorithms for Graph Partitioning Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

A multivariate framework for weighted FPT algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

A Linear-Time Algorithm for the Copy Number Transformation Problem.

[BibT_eX]

[DOI]

Ron Zeira

Ron Shamir

J. Comput. Biol., 2017

Balanced Judicious Partition is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2017

Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms.

[BibT_eX]

[DOI]

CoRR, 2017

On Treewidth and Stable Marriage.

[BibT_eX]

[DOI]

Sushmita Gupta

CoRR, 2017

Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems.

[BibT_eX]

[DOI]

CoRR, 2017

Complexity and algorithms for copy-number evolution problems.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2017

Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

Group Activity Selection on Graphs: Parameterized Analysis.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

Parameterized approximation algorithms for packing problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The k-distinct language: Parameterized automata constructions.

[BibT_eX]

[DOI]

Ran Ben-Basat

Ariel Gabizon

Theor. Comput. Sci., 2016

Representative families: A unified tradeoff-based approach.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

A randomized algorithm for long directed cycle.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Parameterized algorithms for the Module Motif problem.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Deterministic parameterized algorithms for the Graph Motif problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Copy-Number Evolution Problems: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

(k, n-k)-Max-Cut: An 𝒪∗(2p)-Time Algorithm and a Polynomial Kernel.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Parameterized Algorithms for List K-Cycle.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Partial Information Network Queries.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Maximization Problems Parameterized Using Their Minimization Versions: The Case of Vertex Cover.

[BibT_eX]

[DOI]

CoRR, 2015

Mixing Color Coding-Related Techniques.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

A Multivariate Approach for Weighted FPT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Algorithms for topology-free and alignment network queries.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

An Improved k-Exclusion Algorithm.

[BibT_eX]

[DOI]

J. Comput., 2014

Solving Parameterized Problems by Mixing Color Coding-Related Techniques.

[BibT_eX]

[DOI]

CoRR, 2014

FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted.

[BibT_eX]

[DOI]

CoRR, 2014

Faster Computation of Representative Families for Uniform Matroids with Applications.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Deterministic Parameterized Algorithms for Matching and Packing Problems.

[BibT_eX]

[DOI]

CoRR, 2013

Parameterized Algorithms for Module Motif.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Algorithms for k-Internal Out-Branching.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Partial Information Network Queries.

[BibT_eX]

[DOI]