Forthcoming book for children
Hochmat Haalgorithmicaim Hachadasha
Cinnamon Publishing
~350 pages; expected late 2026 / early 2027.
Publications
Books, surveys, and research articles
Books
Research monograph
Kernelization: Theory of Parameterized Preprocessing
Cambridge University Press
>500 pages; published in 2019.
Surveys and book chapters
Parameterized Algorithms on Geometric Intersection Graphs
Computer Science Review, special issue, vol. 58, no. 100796.
Parameterized Complexity in Graph Drawing with Emphasis on Crossing Minimization
Computer Science Review, vol. 45, no. 100490, 2022.
Parameterized Algorithms
Chapter 2 in Beyond Worst-Case Analysis, Cambridge University Press, 2020.
Parameterized Analysis of Art Gallery and Terrain Guarding
Proc. of the 15th International Computer Science Symposium in Russia (CSR 2020), pp. 16–29.
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
In Treewidth, Kernels, and Algorithms, Springer, pp. 112–128, 2020.
Parameterized Computational Geometry via Decomposition Theorems
Proc. of the 13th International Conference and Workshops on Algorithms and Computation (WALCOM 2019), pp. 15–27.
Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis
Chapter 8 in Mathematical Programming and Game Theory, Springer, pp. 141–157, 2018.
Articles
2026
Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
Proc. of the 20st Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’26), pp. 20:1–20:17.
Fine-Grained Bounds for Courcelle’s Theorem
Proc. of the 58th Annual ACM Symposium on Theory of Computing (STOC’26), pp. 2254–2265.
FPT Approximations for Connected Maximum Coverage
Proc. of the 16th Innovations in Theoretical Computer Science (ITCS’25), pp. 80:1-80:24.
Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
Proc. of the 36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’26), pp. 4628–4643.
2025
A Simple Algorithm for Combinatorial n-fold ILPs Using the Steinitz Lemma
Proc. of the 20th International Symposium on Parameterized and Exact Computation (IPEC’25), pp. 14:1-14:17.
A Parameterized Perspective on Uniquely Restricted Matchings
Proc. of the 8th Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS’25), pp. 509-516.
Quasipolynomial-Time Deterministic Kernelization and Gammoid Representation
Proc. of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS’25), pp. 54:1-54:17.
Tournament Robustness via Redundancy
Proc. of the 26th ACM Conference on Economics and Computation (EC’25), pp. 66-85.
What Makes an Ensemble Hard to Interpret? A Theoretical Approach
Proc. of the 42nd International Conference on Machine Learning (ICML’25).
Treewidth Parameterized by Feedback Vertex Number
Proc. of the 52nd International Colloquium on Automata, Languages and Programming (ICALP’25), pp. 120:1-120:20.
(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs
Proc. of the 52nd International Colloquium on Automata, Languages and Programming (ICALP’25), pp. 82:1-82:18.
Subexponential Parameterized Algorithms for Hitting Subgraphs
Proc. of the 57th Annual ACM Symposium on Theory of Computing (STOC’25), pp. 1975-1984.
Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs
Proc. of the 57th Annual ACM Symposium on Theory of Computing (STOC’25), pp. 1965-1974.
Adaptive Manipulation for Coalitions in Knockout Tournaments
Proc. of the 39th AAAI Conference on Artificial Intelligence (AAAI’25), pp. 13700-13708.
Min-Sum Disjoint Paths on Subclasses of Chordal Graphs
Proc. of the 19th International Conference and Workshops on Algorithms and Computation (WALCOM’25), pp. 281-295. Theoretical Computer Science (TCS), no. 1064: 115723, 2026.
Parameterized Geometric Graph Modification with Disk Scaling
Proc. of the 16th Innovations in Theoretical Computer Science (ITCS’25), pp. 51:1-51:17.
Crossing Number in Slightly Superexponential Time
Proc. of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’25), pp. 1412-1424.
2024
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
Proc. of the 35th International Symposium on Algorithms and Computation (ISAAC’24), pp. 41:1-41:17. Journal of Computer and System Sciences (JCSS), vol. 161, no. 103815, 2026.
Exact Algorithms for Clustered Planarity with Linear Saturators
Proc. of the 35th International Symposium on Algorithms and Computation (ISAAC’24), pp. 24:1-24:16.
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
Proc. of the 27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’24), pp. 6:1-6:14.
Hybrid k-Clustering: Blending k-Median and k-Center
Proc. of the 27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’24), pp. 4:1-4:19. ACM Transactions on Computation Theory (ToCT), vol. 17(4), pp. 23:1-23:19, 2025.
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
Proc. of the 33rd International Joint Conference on Artificial Intelligence (IJCAI’24), pp. 2704-2712. Journal of Artificial Intelligence Research (JAIR), vol 83, 2025.
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs
Proc. of the 40th Annual Symposium on Computational Geometry (SoCG’24), pp. 72:1-72:11.
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
Proc. of the 38th AAAI Conference on Artificial Intelligence (AAAI’24), pp. 12100-12108.
How to Make Knockout Tournaments More Popular? Proc
of the 38th AAAI Conference on Artificial Intelligence (AAAI’24), pp. 9582-9589.
Meta-theorems for Parameterized Streaming Algorithms
Proc. of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’24), pp. 712-739.
Kernelization of Counting Problems
Proc. of the 15th Innovations in Theoretical Computer Science (ITCS’24), pp. 77:1-77:23.
Long Directed Detours: Reduction to 2-Disjoint Paths
Information Processing Letters (IPL), vol. 186: 106491.
2023
Parameterized Complexity of Incomplete Connected Fair Division
Proc. of the 43rd Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’23), pp. 14:1-14:18.
Drawn Tree Decomposition: New Approach for Graph Drawing Problems
Proc. of the 18th International Symposium on Parameterized and Exact Computation (IPEC’23), pp. 23:1-23:22. Invited to Algorithmica (the 5 best papers were invited).
Collective Graph Exploration Parameterized by Vertex Cover
Proc. of the 18th International Symposium on Parameterized and Exact Computation (IPEC’23), pp. 22:1-22:18.
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs
Proc. of the 18th International Symposium on Parameterized and Exact Computation (IPEC’23), pp. 10:1-10:22. Journal of Computer and System Sciences (JCSS), vol 156, no. 103715, 2026.
Sidestepping Barriers for Dominating Set in Parameterized Complexity
Proc. of the 18th International Symposium on Parameterized and Exact Computation (IPEC’23), pp. 31:1-31:17.
Planar Disjoint Paths, Treewidth, and Kernels
Proc. of the 64th Annual Symposium on Foundations of Computer Science (FOCS’23), pp. 649-662.
Parameterized Analysis of the Cops and Robber Game
Proc. of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS’23), pp. 49:1-49:17. Journal of Computer and System Sciences (JCSS), vol. 161, no. 103815, 2026.
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large
Proc. of the 31st European Symposium on Algorithms (ESA’23), pp. 65:1-65:17.
Kernelization for Spreading Points
Proc. of the 31st European Symposium on Algorithms (ESA’23), pp. 48:1-48:16.
Lossy Kernelization for (Implicit) Hitting Set Problems
Proc. of the 31st European Symposium on Algorithms (ESA’23), pp. 49:1-49:14.
Parameterized Results on Acyclic Matchings with Implications for Related Problems
Proc. of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’23), pp. 201-216. Journal of Computer and System Sciences (JCSS), vol. 148, pp. 103599, 2025.
P-matchings Parameterized by Treewidth
Proc. of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’23), pp. 217-231. SIAM Journal on Discrete Mathematics (SIDMA), vol. 39, no. 2, pp. 1280-1311, 2025.
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? Proc
of the 32nd International Joint Conference on Artificial Intelligence (IJCAI’23), pp. 180-188.
An ETH-Tight Algorithm for Bidirected Steiner Connectivity
Proc. of the 20th Algorithms and Data Structures Symposium (WADS’23), pp. 588-604.
Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT
Proc. of the 37th AAAI Conference on Artificial Intelligence (AAAI’23), pp. 5876-5883.
On Computing Homological Hitting Sets
Proc. of the 14th Innovations in Theoretical Computer Science (ITCS’23), pp. 13:1-13:21.
A Framework for Approximation Schemes on Disk Graphs
Proc. of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’23), pp. 2228-2241.
Parameterized Approaches to Orthogonal Compaction
Proc. of the 49th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM’23), pp. 11-125. Journal of Computer and System Sciences (JCSS), SOFSEM’23 invited issue, vol. 155, no. 103692, 2026.
2022
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation
Proc. of the 17th International Symposium on Parameterized and Exact Computation (IPEC’22), pp. 1:1-1:16.
Algorithms for Structure Informed Structure Rearrangement
Proc. of the 22nd Workshop on Algorithms in Bioinformatics (WABI’22), pp. 11:1-11:19. Algorithms for Molecular Biology (AMC), vol. 18(1) (WABI’22 invited issue), 17, 2023.
(Re)packing Equal Disks into Rectangle
Proc. of the 49th International Colloquium on Automata, Languages and Programming (ICALP’22), pp. 60:1-60:17. Discrete Computational Geometry (DCG), vol. 72(4), pp. 1596-1629, 2024.
Subexponential Parameterized Algorithms on Disk Graphs
Proc. of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’22), pp. 2005-2031.
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
Proc. of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’22), pp. 1976-2004
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)
SIAM Journal on Discrete Mathematics (SIDMA), vol. 36(1), pp. 596-681, 2022.
Resolute Control: Forbidding Candidates from Winning an Election is Hard
Theoretical Computer Science (TCS), vol. 915, pp. 74-89, 2022.
2021
Grid Recognition: Classical and Parameterized Computational Perspectives
Proc. of the 32nd International Symposium on Algorithms and Computation (ISAAC’21), pp. 37:1-37:15. Journal of Computer and System Sciences (JCSS), vol. 136, pp. 17-62, 2023.
Verification of Multi-Layered Assignment Problems
Proc. of the 18th European Conference on Multi-Agent Systems (EUMAS’21), pp. 194-210. Best Paper Award. Invited to J. Autonomous Agents and Multi-Agent Systems (JAAMAS) (the best paper and runner-up were invited), vol. 36(1):15, 2022.
Parameterized Analysis of Assignment Under Multiple Preferences
Proc. of the 18th European Conference on Multi-Agent Systems (EUMAS’21), pp. 160-177.
Participatory Budgeting with Project Groups
Proc. of the 30th International Joint Conference on Artificial Intelligence (IJCAI’21), pp. 276-281. Journal of Computer and System Sciences (JCSS), vol. 156, no. 103702, 2026.
Exploiting Dense Structures in Parameterized Complexity
Proc. of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS’21), pp. 50:1-50:17.
Multivariate Analysis of Scheduling Fair Competitions
Proc. of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS’21), pp. 555-564.
Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting
Proc. of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’21), pp. 179-198.
FPT Approximation for FPT Problems
Proc. of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’21), pp. 199-218.
2020
On the (Parameterized) Complexity of Almost Stable Marriage
Proc. of the 40th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’20), pp. 24:1-24:17.
Approximate Search for Known Gene Clusters in New Genomes Using PQ-Trees
Proc. of the 20th Workshop on Algorithms in Bioinformatics (WABI’20), pp. 1:1-1:24. Algorithms for Molecular Biology (AMB), vol. 16(1):16, 2021, WABI’20 invited issue.
Tight Lower Bounds on the Computation of Hadwiger Number and Related Contraction-Based Problems
Proc. of the 47th International Colloquium on Automata, Languages and Programming (ICALP’20), pp. 49:1-49:18. ACM Transactions on Computation Theory (ToCT), vol 13(2), pp. 10:1-10:25, 2021.
Parameter Analysis for Guarding Terrains
Proc. of the 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’20), pp. 4:1-4:18. Algorithmica, vol. 84(4), pp. 961-981, 2022.
Parameterized Study of Steiner Tree on Unit Disk Graphs
Proc. of the 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’20), pp. 13:1-13:18. Algorithmica, vol. 85(1), pp. 133-152, 2023.
Graph Hamiltonicity Parameterized by Proper Interval Deletion Set
Proc. of the 15th Latin American Theoretical Informatics Symposium (LATIN’20), pp. 104-115.
The Parameterized Complexity of Guarding Almost Convex Polygons
Proc. of the 36th Annual Symposium on Computational Geometry (SoCG’20), pp. 3:1-3:16. Discrete Computational Geometry (DCG), vol. 71(2), pp. 358-398, 2024. Also: Invited to Journal of Computational Geometry (special issue for selected SoCG’20 papers), we declined the invitation.
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
Proc. of the 36th Annual Symposium on Computational Geometry (SoCG’20), pp. 44:1-44:18. Invited to Journal of Computational Geometry (JCG), vol. 12(2), pp. 126-148, 2021. Invited SoCG’20 issue.
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
Proc. of the 52nd Annual ACM Symposium on Theory of Computing (STOC’20), pp. 1307-1316. SIAM Journal on Computing (SICOMP), vol. 54(2), pp. 321-418, 2025.
Hitting Topological Minors is FPT
Proc. of the 52nd Annual ACM Symposium on Theory of Computing (STOC’20), pp. 1317-1326.
Parameterization Above a Multiplicative Guarantee
Proc. of the 11th Innovations in Theoretical Computer Science (ITCS’20), pp. 39:1-39:13. ACM Transactions on Computation Theory (TALG) vol. 13(3), pp. 18:1-18:16, 2021.
Fault Tolerant Subgraphs with Applications in Kernelization
Proc. of the 11th Innovations in Theoretical Computer Science (ITCS’20), pp. 47:1-47:22.
Approximation Schemes via Width/Weight Tradeoffs on Minor-free Graphs
Proc. of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’20), pp. 2299-2318.
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
Proc. of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’20), pp. 2181-2200.
A Note on GRegNetSim: A Tool for the Discrete Simulation and Analysis of Genetic Regulatory Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), vol. 17(1), pp. 316-320.
Quadratic Vertex Kernel for Rainbow Matching
Algorithmica, vol. 82(4), pp. 881-897.
2019
Going Far From Degeneracy
Proc. of the 27th European Symposium on Algorithms (ESA’19), pp. 47:1-47:14. SIAM Journal on Discrete Mathematics (SIDMA), vol. 34(3), pp. 1587-1601, 2020.
A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation
Proc. of the 19th Workshop on Algorithms in Bioinformatics (WABI’19), pp. 9:1-9:13. Journal of Computational Biology (JCB), vol. 27(11), pp. 1561-1580, 2020.
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
Proc. of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS’19), pp. 28:1-28:14. Algorithmica, vol. 83(6), pp. 1861-1884, 2021.
Packing Arc-Disjoint Cycles in Tournaments
Proc. of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS’19), pp. 27:1-27:14. Algorithmica, vol. 83(5), pp. 1393-1420, 2021.
The Parameterized Complexity of Motion Planning for Snake-Like Robots
Proc. of the 28th International Joint Conference on Artificial Intelligence (IJCAI’19), pp. 5670-5676. Journal of Artificial Intelligence Research (JAIR), vol. 69, pp. 191-229, 2020. (Invited to AIJ/JAIR special issue, we declined the invitation.)
On Succinct Encodings for the Tournament Fixing Problem
Proc. of the 28th International Joint Conference on Artificial Intelligence (IJCAI’19), pp. 322-328.
Rank Vertex Cover as a Natural Problem for Algebraic Compression
SIAM Journal on Discrete Mathematics (SIDMA), vol. 33(3), pp. 1277-1296, 2019.
Approximate Counting of k-Paths: Deterministic and in Polynomial Space
Proc. of the 46th International Colloquium on Automata, Languages and Programming (ICALP’19), pp. 24:1-24:15. ACM Transactions on Algorithms (TALG), vol. 17(3), pp. 26:1-26:44, 2021.
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals
Proc. of the 46th International Colloquium on Automata, Languages and Programming (ICALP’19), pp. 59:1-59:13.
Decomposition of Map Graphs with Applications
Proc. of the 46th International Colloquium on Automata, Languages and Programming (ICALP’19), pp. 60:1-60:15.
Balanced Stable Marriage: How Close is Close Enough? Abstract in Proc
of the 5th International Workshop on Matching Under Preferences (MATCH-UP’19). Proc. of the 16th Algorithms and Data Structures Symposium (WADS’19), pp. 423-437. Theoretical Computer Science (TCS), vol. 883, pp. 19-43, 2021.
Connecting the Dots (with Minimum Crossings)
Proc. of the 35th Annual Symposium on Computational Geometry (SoCG’19), pp. 7:1-7:17.
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms
Proc. of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS’19), pp. 511-519. J. Autonomous Agents and Multi-Agent Systems (JAAMAS), vol. 34(1), 27, 2020.
On r-Simple k-Path and Related Problems Parameterized by k/r
Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’19), pp. 1750-1769. ACM Transactions on Algorithms (TALG), vol. 17(1), pp. 10:1-10:64, 2021.
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity
Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’19), pp. 1035-1054. ACM Transactions on Algorithms (TALG), vol. 20(2), 15, 2024.
Interval Vertex Deletion Admits a Polynomial Kernel
Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’19), pp. 1711-1730. ACM Transactions on Algorithms (TALG), vol. 19(2), pp. 11:1-11:68, 2023.
Popular Matching in Roommates Setting is NP-hard
Proc. of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’19), pp. 2810-2822. Bulletin of the EATCS (summary), 130, 2020. ACM Transactions on Computation Theory (ToCT), vol. 13(2), pp. 9:1-9:20, 2021.
The Parametrized Complexity Landscape of Finding 2-Partitions of Digraphs
Theoretical Computer Science (TCS), vol. 795, pp. 108-114.
2018
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Proc. of the 38th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’18), pp. 35:1-35:19. Algorithmica, vol. 85(1), pp. 133-152, 2023.
Parameterized Complexity of Multi-Node Hubs
Proc. of the 13th International Symposium on Parameterized and Exact Computation (IPEC’18), pp. 8:1-8:14. Journal of Computer and System Sciences (JCSS), vol. 131, pp. 64-85, 2023.
Polylogarithmic Approximation Algorithms for Weighted F-Deletion Problems
Proc. of the 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’18), pp. 1:1-1:15. ACM Transactions on Algorithms (TALG), vol. 16(4), pp. 51:1-51:38, 2020.
When Rigging a Tournament, Let Greediness Blind You
Proc. of the 27th International Joint Conference on Artificial Intelligence (IJCAI’18), pp. 275-281.
Winning a Tournament by Any Means Necessary
Proc. of the 27th International Joint Conference on Artificial Intelligence (IJCAI’18), pp. 282-288.
Treewidth Modulator: Emergency Exit for DFVS
Brief announcement in Proc. of the 45th International Colloquium on Automata, Languages and Programming (ICALP’18), pp. 110:1-110:4. Proc. of the 16th Algorithms and Data Structures Symposium (WADS’19), pp. 523-537. Retitled: Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. ACM Transactions on Computation Theory (ToCT), vol. 17(1), pp. 2:1-2:28, 2025.
Reducing CMSO Model Checking to Highly Connected Graphs
Proc. of the 45th International Colloquium on Automata, Languages and Programming (ICALP’18), pp. 135:1-135:14.
Long Directed (s, t)-Path: FPT Algorithm
Information Processing Letters (IPL), vol. 140, pp. 8-12, 2018.
Max-Cut Above Spanning Tree is Fixed Parameter Tractable
Proc. of the 13th International Computer Science Symposium in Russia (CSR’18), pp. 244-256. Best Paper Award. Theory of Computing Systems (TOCS), vol. 64(1), pp. 62-100, 2020. Invited CSR’18 issue. Retitled: Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree.
Stability in Barter Exchange Markets
Proc. of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS’18), pp. 1371-1379. Journal of Autonomous Agents and Multi-Agent System (JAAMAS), vol. 33(5), pp. 518-539, 2019. Invited AAMAS’18 issue.
Erdős-Pósa Property of Obstructions to Interval Graphs
Proc. of the 35th International Symposium on Theoretical Aspects of Computer Science (STACS’18), pp. 7:1-7:15. Journal of Graph Theory (JGT), vol. 102(4), pp. 702-727, 2023.
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
Proc. of the 14th Latin American Theoretical Informatics Symposium (LATIN’18), pp. 712-726. Algorithmica, vol. 81(9), pp. 3803-3841, 2019.
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity
Proc. of the 9th Innovations in Theoretical Computer Science (ITCS’18), pp. 32:1-32:13.
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
Proc. of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18), pp. 2785-2800. ACM Transactions on Algorithms (TALG), vol. 16(3), pp. 32:1-32:31, 2020.
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems
Proc. of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18), pp. 331-342. With Fomin, F.V.: ACM Transactions on Algorithms (TALG), vol. 15(1), pp. 13:1-13:44, 2019.
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth
Proc. of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18), pp. 262-273. With Fomin, F.V.: ACM Transactions on Algorithms (TALG), vol. 15(1), pp. 9:1-9:27, 2019. Retitled: Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring Parameterized by Cliquewidth.
Parameterized Algorithms for Survival Network Design with Uniform Demands
Proc. of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18), pp. 2838-2850.
Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials
Journal of Computer and System Sciences (JCSS), vol. 95, pp. 69-85, 2018.
Parameterized Algorithms for Stable Matching with Ties and Incomplete Lists
Theoretical Computer Science (TCS), vol. 723, pp. 1-10, 2018.
Parameterised Algorithms for Deletion to Classes of DAGs
Theory of Computing Systems (TOCS), vol. 62(8), pp. 1880-1909, 2018.
2017
Balanced Judicious Bipartition is Fixed-Parameter Tractable
Proc. of the 37th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’17), pp. 40:40-40:15. SIAM Journal on Discrete Mathematics (SIDMA), vol. 33(4), pp. 1878-1911, 2019.
Parameterized Analysis for the Group Activity Selection Problem
Proc. of the 10th International Symposium on Algorithmic Game Theory (SAGT’17), pp. 106-118.
Parameterized Algorithms and Kernels for Rainbow Matching
Proc. of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS’17), pp. 71:1-71:13. Algorithmica, vol. 81(4), pp. 1684-1698, 2019.
Parameterized Algorithms for Finding, Hitting and Packing Cycles on Unit Disk Graphs
Proc. of the 44th International Colloquium on Automata, Languages and Programming (ICALP’17), pp. 65:1-65:14. Discrete and Computational Geometry, vol. 62(4), pp. 879-911, 2019.
Packing Cycles Faster Than Erdős-Pósa
Proc. of the 44th International Colloquium on Automata, Languages and Programming (ICALP’17), pp. 71:1-71:15. SIAM Journal on Discrete Mathematics (SIDMA), vol. 33(3), pp. 1194-1215, 2019.
The Maximum-Duo Preservation String Mapping Problem Revisited
Proc. of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM’17), pp. 11:1-11:17. Theoretical Computer Science (TCS), vol. 847, pp. 27-38, 2020.
Exact Algorithms for Terrain Guarding
Proc. of the 33rd Annual Symposium on Computational Geometry (SoCG’17), pp. 11:1-11:15. ACM Transactions on Algorithms (TALG), vol. 14(2), pp. 25:1-25:20, 2018.
Split Contraction: The Untold Story
Proc. of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS’17), pp. 5:1-5:14. ACM Transactions on Computation Theory (ToCT), vol. 11(3), pp. 18:1-18:22, 2019.
Matrix Rigidity: Matrix Theory from the Viewpoint of Parameterized Complexity
Proc. of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS’17), pp. 32:1-32:14. SIAM Journal on Discrete Mathematics (SIDMA), vol. 32(3), pp. 966-985, 2018.
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Proc. of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’17), pp. 1383-1398. ACM Transactions on Algorithms (TALG), vol. 15(1), pp. 11:1-11:28, 2019.
2016
Parameterized Algorithms for List K-Cycle
Proc. of the 36th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’16), pp. 22:1-22:15. With Saurabh, S.: Algorithmica, vol. 81(3), pp. 1267-1287.
Kernels for Deletion to Classes of Acyclic Graphs
Proc. of the 27th International Symposium on Algorithms and Computation (ISAAC’16), pp. 6:1-6:12. Journal of Computer and System Sciences (JCSS), vol. 92, pp. 9-21, 2018.
Simultaneous Feedback Edge Set
Proc. of the 27th International Symposium on Algorithms and Computation (ISAAC’16), pp. 5:1-5:12. Algorithmica, vol. 83(2), pp. 753-774, 2021.
Parameterized Approximation Algorithms for Packing Problems
Theoretical Computer Science (TCS), vol. 648, pp. 40-55, 2016.
Copy-Number Evolution Problems: Complexity and Algorithms
Proc. of the 16th Workshop on Algorithms in Bioinformatics (WABI’16), pp. 137-149. Algorithms for Molecular Biology (AMB), vol. 12(1), pp. 13:1-13:11, 2017. Invited WABI’16 issue.
A Linear-Time Algorithm for the Copy Number Transformation Problem
Proc. of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM’16), pp. 16:1-16:13. Journal of Computational Biology (JCB), vol. 24(12), pp. 1179-1194, 2017.
A Randomized Algorithm for Long Directed Cycle
Information Processing Letters (IPL), vol. 116(6), pp. 419-422, 2016.
(k, n − k)-Max-Cut: An O∗ (2p )-Time Algorithm and a Polynomial Kernel
Proc. of the 12th Latin American Theoretical Informatics Symposium (LATIN’16), pp. 686-699. Algorithmica, vol. 80(12), pp. 3844-3860, 2018.
2015
The k-Leaf Spanning Tree Problem Admits a Klam Value of 39
Proc. of the 26th International Workshop on Combinatorial Algorithms (IWOCA’15), pp. 346-357. Best Student Paper Award. European Journal of Combinatorics (EJC), vol. 68, pp. 175-203, 2018. Invited IWOCA’15 issue.
A Multivariate Approach for Weighted FPT Algorithms
Proc. of the 23rd European Symposium on Algorithms (ESA’15), pp. 965-976. Journal of Computer and System Sciences (JCSS), vol. 89, pp. 157-189, 2017.
Mixing Color Coding-Related Techniques
Proc. of the 23rd European Symposium on Algorithms (ESA’15), pp. 1037-1049. Best Student Paper Award.
Maximum Minimal Vertex Cover Parameterized by Vertex Cover
Proc. of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS’15), pp. 589-600. Best Student Paper Award. SIAM Journal on Discrete Mathematics (SIDMA), vol. 31(4), pp. 2440-2456, 2017.
Spotting Trees with Few Leaves
Proc. of the 42nd International Colloquium on Automata, Languages and Programming (ICALP’15), pp. 243-255. SIAM Journal on Discrete Mathematics (SIDMA), vol. 31(2), pp. 687-713, 2017.
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets
SIAM Journal on Discrete Mathematics (SIDMA), vol. 29(4), pp. 1815-1836, 2015.
2014
Improved Parameterized Algorithms for Network Query Problems
Proc. of the 9th International Symposium on Parameterized and Exact Computation (IPEC’14), pp. 294-306. Algorithmica, vol. 81(6), pp. 2270-2316, 2019.
The k-Distinct Language: Parameterized Automata Constructions
Proc. of the 9th International Symposium on Parameterized and Exact Computation (IPEC’14), pp. 85-96. Theoretical Computer Science (TCS), vol. 622, pp. 1-15, 2016.
Representative Families: A Unified Tradeoff-Based Approach
Proc. of the 22nd European Symposium on Algorithms (ESA’14), pp. 786-797. Journal of Computer and System Sciences (JCSS), vol. 82(3), pp. 488-502, 2016.
Deterministic Parameterized Algorithms for the Graph Motif Problem
Proc. of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS’14), pp. 589-600. Discrete Applied Mathematics (DAM), vol. 213, pp. 162-178, 2016.
An Improved k-Exclusion Algorithm
Journal of Computers (JCP), vol. 9, pp. 529-536, 2014.
Parameterized Algorithms for Graph Partitioning Problems
Proc. of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’14), pp. 384-395. Theory of Computing Systems (TOCS), vol. 61(3), pp. 721-738, 2017.
Algorithms for Topology-Free and Alignment Network Queries
Journal of Discrete Algorithms (JDA), vol. 27, pp. 29-53, 2014.
2013 (MSc)
Algorithms for k-Internal Out-Branching
Proc. of the 8th International Symposium on Parameterized and Exact Computation (IPEC’13), pp. 361-373. Algorithmica, vol. 78(1), pp. 319-341, 2017. Retitled: Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs.
Parameterized Algorithms for Module Motif
Proc. of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS’13), pp. 825-836. Information and Computation, vol. 251, pp. 179-193, 2016.
Partial Information Network Queries
Proc. of the 24th International Workshop on Combinatorial Algorithms (IWOCA’13), pp. 362-375. With Shachnai, H.: Journal of Discrete Algorithms (JDA), vol. 31, pp. 129-145, 2015. Invited IWOCA’13 issue.