| Publication | Date of Publication | Type |
|---|
Dominator coloring and CD coloring in almost cluster graphs
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Parameterized complexity of deletion to scattered graph classes
| 2023-11-13 | Paper |
Structural parameterizations with modulator oblivion
| 2023-11-13 | Paper |
Deletion to scattered graph classes. I: Case of finite number of graph classes
Journal of Computer and System Sciences | 2023-08-21 | Paper |
Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
Journal of Computer and System Sciences | 2023-06-12 | Paper |
Structural parameterizations of budgeted graph coloring
Theoretical Computer Science | 2023-04-20 | Paper |
Sublinear-space approximation algorithms for Max \(r\)-SAT
| 2023-03-30 | Paper |
scientific article; zbMATH DE number 7650305 (Why is no real title available?)
| 2023-02-03 | Paper |
Improved kernels for tracking paths
Information Processing Letters | 2023-02-03 | Paper |
The complexity of finding certain trees in tournaments
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Recognizing \(k\)-clique extendible orderings
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Improved upper bounds for time-space tradeoffs for selection with limited storage
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Output sensitive fault tolerant maximum matching
| 2022-11-11 | Paper |
Finding kings in tournaments
Discrete Applied Mathematics | 2022-10-13 | Paper |
Structural parameterizations of Tracking Paths problem
Theoretical Computer Science | 2022-10-06 | Paper |
Tight bounds for finding degrees from the adjacency matrix
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
Structural parameterizations with modulator oblivion
Algorithmica | 2022-08-03 | Paper |
Approximation in (Poly-) Logarithmic Space
| 2022-07-18 | Paper |
Structural parameterizations of budgeted graph coloring
WALCOM: Algorithms and Computation | 2022-07-13 | Paper |
Faster FPT algorithms for deletion to pairs of graph classes
| 2022-05-20 | Paper |
Parameterizing role coloring on forests
| 2022-03-24 | Paper |
Recognizing \(k\)-clique extendible orderings
Algorithmica | 2021-11-19 | Paper |
Frameworks for designing in-place graph algorithms
Journal of Computer and System Sciences | 2021-10-28 | Paper |
A framework for in-place graph algorithms
| 2021-08-04 | Paper |
Parameterized complexity of conflict-free set cover
Theory of Computing Systems | 2021-08-03 | Paper |
Approximation in (poly-) logarithmic space
Algorithmica | 2021-06-30 | Paper |
Fixed-parameter tractability of \((n-k)\) list coloring
Theory of Computing Systems | 2021-06-11 | Paper |
Fixed-parameter tractable algorithms for tracking shortest paths
Theoretical Computer Science | 2020-11-06 | Paper |
Elusiveness of finding degrees
Discrete Applied Mathematics | 2020-09-17 | Paper |
A characterization of König-Egerváry graphs with extendable vertex covers
Information Processing Letters | 2020-08-04 | Paper |
Recognizing $k$-Clique Extendible Orderings
| 2020-07-12 | Paper |
Some (in)tractable parameterizations of coloring and list-coloring
| 2020-07-07 | Paper |
Fully dynamic arboricity maintenance
Theoretical Computer Science | 2020-05-23 | Paper |
List-coloring -- parameterizing from triviality
Theoretical Computer Science | 2020-04-22 | Paper |
Fixed-parameter tractability of \((n-k)\) list coloring
Lecture Notes in Computer Science | 2020-02-25 | Paper |
Solving group interval scheduling efficiently
| 2020-02-25 | Paper |
Fully dynamic arboricity maintenance
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Deconstructing parameterized hardness of Fair Vertex Deletion problems
| 2020-02-24 | Paper |
A polynomial sized kernel for tracking paths problem
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
A polynomial sized kernel for tracking paths problem
Algorithmica | 2020-01-16 | Paper |
Parameterized complexity of geometric covering problems having conflicts
Algorithmica | 2020-01-16 | Paper |
Tractability of König edge deletion problems
Theoretical Computer Science | 2019-11-13 | Paper |
Parameterized complexity of conflict-free set cover
Computer Science – Theory and Applications | 2019-10-22 | Paper |
Revisiting connected vertex cover: FPT algorithms and lossy kernels
Theory of Computing Systems | 2019-09-05 | Paper |
Polynomial kernels for vertex cover parameterized by small degree modulators
Theory of Computing Systems | 2019-09-05 | Paper |
Space efficient linear time algorithms for BFS, DFS and applications
Theory of Computing Systems | 2019-09-05 | Paper |
Selection and sorting in the ``restore model
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Harmonious coloring: parameterized algorithms and upper bounds
Theoretical Computer Science | 2019-05-17 | Paper |
FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
Frontiers in Algorithmics | 2019-04-26 | Paper |
The complexity of finding (approximate sized) distance-\(d\) dominating set in tournaments
Frontiers in Algorithmics | 2019-04-26 | Paper |
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
Algorithmica | 2019-01-11 | Paper |
Structural parameterizations of dominating set variants
| 2018-11-28 | Paper |
Maintaining chordal graphs dynamically: improved upper and lower bounds
| 2018-11-28 | Paper |
Selection and sorting in the ``restore model
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Faster parameterized algorithms using linear programming
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
Algorithmica | 2018-07-26 | Paper |
Fréchet distance between a line and avatar point set
Algorithmica | 2018-07-26 | Paper |
Approximability of clique transversal in perfect graphs
Algorithmica | 2018-07-25 | Paper |
scientific article; zbMATH DE number 6863617 (Why is no real title available?)
| 2018-04-23 | Paper |
Fréchet distance between a line and avatar point set
| 2018-04-19 | Paper |
Biconnectivity, chain decomposition and \(st\)-numbering using \(O(n)\) bits
| 2018-04-19 | Paper |
Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs
| 2018-03-21 | Paper |
Finding modes with equality comparisons
Theoretical Computer Science | 2017-11-16 | Paper |
On the succinct representation of equivalence classes
Algorithmica | 2017-10-09 | Paper |
scientific article; zbMATH DE number 6783430 (Why is no real title available?)
| 2017-09-29 | Paper |
Kernels for structural parameterizations of vertex cover -- case of small degree modulators
| 2017-09-29 | Paper |
Shortest reconfiguration paths in the solution space of Boolean formulas
SIAM Journal on Discrete Mathematics | 2017-09-27 | Paper |
Parameterized complexity of geometric covering problems having conflicts
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
Journal of Computer and System Sciences | 2017-09-15 | Paper |
On the parameterized complexity of reconfiguration problems
Algorithmica | 2017-05-11 | Paper |
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Elusiveness of finding degrees
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Exact and parameterized algorithms for \((k,i)\)-coloring
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Path balance heuristic for self-adjusting binary search trees
Lecture Notes in Computer Science | 2017-01-19 | Paper |
Harmonious coloring: parameterized algorithms and upper bounds
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Improved space efficient algorithms for BFS, DFS and applications
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Less space: indexing for queries with wildcards
Theoretical Computer Science | 2016-06-27 | Paper |
A simplified NP-complete MAXSAT problem
Information Processing Letters | 2016-06-09 | Paper |
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters | 2016-06-09 | Paper |
Finding mode using equality comparisons
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Space efficient data structures for nearest larger neighbor
Journal of Discrete Algorithms | 2016-02-18 | Paper |
Sorting and selection with equality comparisons
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Shortest reconfiguration paths in the solution space of Boolean formulas
Automata, Languages, and Programming | 2015-10-27 | Paper |
The complexity of bounded length graph recoloring and CSP reconfiguration
Parameterized and Exact Computation | 2015-09-15 | Paper |
Space efficient data structures for nearest larger neighbor
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Reconfiguration over tree decompositions
Parameterized and Exact Computation | 2015-09-15 | Paper |
Tradeoff between label space and auxiliary space for representation of equivalence classes
Algorithms and Computation | 2015-09-11 | Paper |
Vertex Cover Reconfiguration and Beyond
Algorithms and Computation | 2015-09-11 | Paper |
Faster fixed parameter tractable algorithms for finding feedback vertex sets
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Succinct ordinal trees with level-ancestor queries
| 2015-08-03 | Paper |
Finding median in read-only memory on integer input
Theoretical Computer Science | 2015-04-29 | Paper |
Polynomial kernels for \textsc{Dominating Set} in graphs of bounded degeneracy and beyond
ACM Transactions on Algorithms | 2014-12-05 | Paper |
The kernelization complexity of connected domination in graphs with (no) small cycles
Algorithmica | 2014-12-02 | Paper |
Improved explicit data structures in the bitprobe model
Algorithms - ESA 2014 | 2014-10-08 | Paper |
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
Information and Computation | 2014-01-16 | Paper |
Solving min ones 2-SAT as fast as vertex cover
Theoretical Computer Science | 2014-01-16 | Paper |
Less space: indexing for queries with wildcards
Algorithms and Computation | 2014-01-14 | Paper |
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
Algorithms and Computation | 2014-01-14 | Paper |
Succinct data structures for representing equivalence classes
Algorithms and Computation | 2014-01-14 | Paper |
Parameterized complexity of MaxSat above average
Theoretical Computer Science | 2014-01-13 | Paper |
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
Information and Computation | 2014-01-10 | Paper |
On the parameterized complexity of reconfiguration problems
Lecture Notes in Computer Science | 2013-12-10 | Paper |
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
Theory of Computing Systems | 2013-12-02 | Paper |
An FPT algorithm for Tree Deletion Set
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
A Survey of Data Structures in the Bitprobe Model
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Fixed-parameter tractability of satisfying beyond the number of variables
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Upper and lower bounds for weak backdoor set detection
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
The parameterized complexity of unique coverage and its variants
Algorithmica | 2013-08-05 | Paper |
An FPT algorithm for tree deletion set
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Improved fixed-parameter algorithm for the minimum weight 3-SAT problem
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
Subexponential algorithms for partial cover problems
Information Processing Letters | 2013-04-04 | Paper |
FPT algorithms for connected feedback vertex set
Journal of Combinatorial Optimization | 2012-12-21 | Paper |
On parameterized independent feedback vertex set
Theoretical Computer Science | 2012-11-27 | Paper |
Parameterized algorithms for even cycle transversal
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Subexponential algorithms for partial cover problems
| 2012-10-24 | Paper |
On the directed full degree spanning tree problem
Discrete Optimization | 2012-10-16 | Paper |
Lower bounds on kernelization
Discrete Optimization | 2012-10-16 | Paper |
Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
The effect of girth on the kernelization complexity of connected dominating set
| 2012-08-29 | Paper |
LP can be a cure for parameterized problems
| 2012-08-23 | Paper |
Faster algorithms for finding and counting subgraphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Succinct representations of permutations and functions
Theoretical Computer Science | 2012-08-08 | Paper |
Parameterized complexity of MaxSat above average
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
| 2012-01-23 | Paper |
A polynomial kernel for Feedback Arc Set on bipartite tournaments
Algorithms and Computation | 2011-12-16 | Paper |
The complexity of König subgraph problems and above-guarantee vertex cover
Algorithmica | 2011-12-14 | Paper |
Paths, flowers and vertex cover
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On parameterized independent feedback vertex set
Lecture Notes in Computer Science | 2011-08-17 | Paper |
A quartic kernel for pathwidth-one vertex deletion
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Solving \textsc{minones-2-sat} as fast as \textsc{vertex cover}
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Parameterized complexity of directed feedback set problems in tournaments.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Parameterized complexity of the induced subgraph problem in directed graphs
Information Processing Letters | 2010-03-24 | Paper |
Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
Information Processing Letters | 2010-03-24 | Paper |
FPT algorithms for connected feedback vertex set
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
On the directed degree-preserving spanning tree problem
Parameterized and Exact Computation | 2010-01-14 | Paper |
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Lecture Notes in Computer Science | 2009-10-29 | Paper |
The Budgeted Unique Coverage Problem and Color-Coding
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences | 2009-03-11 | Paper |
König Deletion Sets and Vertex Covers above the Matching Size
Algorithms and Computation | 2009-01-29 | Paper |
Parameterized Algorithms for Generalized Domination
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
Algorithmica | 2008-12-02 | Paper |
Parameterizing MAX SNP Problems Above Guaranteed Values
Parameterized and Exact Computation | 2008-06-03 | Paper |
The Parameterized Complexity of the Unique Coverage Problem
Algorithms and Computation | 2008-05-27 | Paper |
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
Algorithms and Computation | 2008-05-27 | Paper |
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Efficient exact algorithms through enumerating maximal independent sets and other techniques
Theory of Computing Systems | 2007-12-19 | Paper |
Triangles, 4-Cycles and Parameterized (In-)Tractability
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
scientific article; zbMATH DE number 5158513 (Why is no real title available?)
| 2007-05-29 | Paper |
A simple optimal representation for balanced parentheses
Theoretical Computer Science | 2007-01-22 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
APPROXIMATE BLOCK SORTING
International Journal of Foundations of Computer Science | 2006-05-10 | Paper |
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science | 2006-04-06 | Paper |
Representing trees of higher degree
Algorithmica | 2006-03-21 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
scientific article; zbMATH DE number 2185611 (Why is no real title available?)
| 2005-07-04 | Paper |
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2038722 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1979521 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1979503 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1875423 (Why is no real title available?)
| 2003-03-02 | Paper |
Parameterized complexity of finding subgraphs with hereditary properties.
Theoretical Computer Science | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1830754 (Why is no real title available?)
| 2002-11-18 | Paper |
Selecting small ranks in EREW PRAM
Information Processing Letters | 2002-07-25 | Paper |
A tradeoff between search and update in dictionaries
Information Processing Letters | 2002-07-25 | Paper |
scientific article; zbMATH DE number 1696630 (Why is no real title available?)
| 2002-07-22 | Paper |
Succinct representation of balanced parentheses and static trees
SIAM Journal on Computing | 2002-04-23 | Paper |
Representing dynamic binary trees succinctly
| 2002-01-30 | Paper |
scientific article; zbMATH DE number 1522934 (Why is no real title available?)
| 2001-10-30 | Paper |
scientific article; zbMATH DE number 1539540 (Why is no real title available?)
| 2001-03-15 | Paper |
scientific article; zbMATH DE number 1522919 (Why is no real title available?)
| 2001-02-27 | Paper |
Space efficient suffix trees
Journal of Algorithms | 2001-01-01 | Paper |
scientific article; zbMATH DE number 1383709 (Why is no real title available?)
| 2000-10-17 | Paper |
The complexity of irredundant sets parameterized by size
Discrete Applied Mathematics | 2000-03-22 | Paper |
Parameterizing above Guaranteed Values: MaxSat and MaxCut
Journal of Algorithms | 1999-09-29 | Paper |
Selection from read-only memory and sorting with minimum data movement
Theoretical Computer Science | 1997-02-27 | Paper |
Fast stable in-place sorting with \(O(n)\) data moves
Algorithmica | 1996-08-12 | Paper |
scientific article; zbMATH DE number 177571 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 140497 (Why is no real title available?)
| 1993-03-28 | Paper |
Sorting with minimum data movement
Journal of Algorithms | 1993-01-16 | Paper |
scientific article; zbMATH DE number 26483 (Why is no real title available?)
| 1992-06-27 | Paper |
Stable in situ sorting and minimum data movement
BIT | 1990-01-01 | Paper |
