| Publication | Date of Publication | Type |
|---|
Reconfiguration of time-respecting arborescences
Algorithmica | 2025-12-30 | Paper |
Changing induced subgraph isomorphisms under extended reconfiguration rules
Information and Computation | 2025-12-15 | Paper |
| Finding induced subgraphs from graphs with small mim-width | 2025-12-02 | Paper |
Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles
Journal of Applied and Computational Topology | 2025-10-22 | Paper |
On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes
Theoretical Computer Science | 2025-09-16 | Paper |
Parameterized complexity of weighted target set selection
Theoretical Computer Science | 2025-08-01 | Paper |
The two-sample Mood statistic for clustered data
Statistical Papers | 2025-05-12 | Paper |
| Changing induced subgraph isomorphisms under extended reconfiguration rules | 2025-04-15 | Paper |
| Parameterized complexity of weighted target set selection | 2024-11-12 | Paper |
| Algorithms for coloring reconfiguration under recolorability digraphs | 2024-09-11 | Paper |
| On the routing problems in graphs with ordered forbidden transitions | 2024-08-22 | Paper |
| The shortest path reconfiguration problem based on relaxation of reconfiguration rules | 2024-07-19 | Paper |
| On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes | 2024-07-19 | Paper |
| Sorting balls and water: equivalence and computational complexity | 2024-05-16 | Paper |
| Reconfiguration of spanning trees with degree constraint or diameter constraint | 2024-04-23 | Paper |
Reconfiguration of time-respecting arborescences
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Parameterized complexity of optimizing list vertex-coloring through reconfiguration
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Happy set problem on subclasses of co-comparability graphs
Algorithmica | 2023-11-17 | Paper |
Path cover problems with length cost
Algorithmica | 2023-11-17 | Paper |
| Fixed-parameter algorithms for graph constraint logic | 2023-11-13 | Paper |
Feedback vertex set reconfiguration in planar graphs
Theoretical Computer Science | 2023-10-26 | Paper |
Sorting balls and water: equivalence and computational complexity
Theoretical Computer Science | 2023-10-12 | Paper |
ZDD-based algorithmic framework for solving shortest reconfiguration problems
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 2023-10-04 | Paper |
Reconfiguration of spanning trees with degree constraints or diameter constraints
Algorithmica | 2023-09-27 | Paper |
Distribution-free Phase-I scheme for location, scale and skewness shifts with an application in monitoring customers' waiting time
Journal of Applied Statistics | 2023-07-03 | Paper |
Fixed-parameter algorithms for graph constraint logic
Theoretical Computer Science | 2023-05-12 | Paper |
| Decremental optimization of vertex-coloring under the reconfiguration framework | 2023-03-30 | Paper |
| Shortest Reconfiguration of Colorings Under Kempe Changes | 2023-02-07 | Paper |
Reconfiguration of Spanning Trees with Many or Few Leaves
(available as arXiv preprint) | 2023-02-07 | Paper |
Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| Algorithms for Coloring Reconfiguration Under Recolorability Constraints | 2022-07-21 | Paper |
Incremental optimization of independent sets under the reconfiguration framework
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
| Happy set problem on subclasses of co-comparability graphs | 2022-07-13 | Paper |
| Path cover problems with length cost | 2022-07-13 | Paper |
Trichotomy for the reconfiguration problem of integer linear systems
Theoretical Computer Science | 2021-01-19 | Paper |
| Complexity of coloring reconfiguration under recolorability constraints | 2020-11-25 | Paper |
Diameter of colorings under Kempe changes
Theoretical Computer Science | 2020-09-01 | Paper |
Reconfiguring k-path vertex covers
(available as arXiv preprint) | 2020-07-22 | Paper |
Trichotomy for the reconfiguration problem of integer linear systems
Lecture Notes in Computer Science | 2020-07-22 | Paper |
Parameterized complexity of independent set reconfiguration problems
Discrete Applied Mathematics | 2020-06-29 | Paper |
| Max-Min 3-Dispersion problems | 2020-02-24 | Paper |
Incremental optimization of independent sets under the reconfiguration framework
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Diameter of colorings under Kempe changes
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Reconfiguring spanning and induced subgraphs
Theoretical Computer Science | 2020-01-16 | Paper |
Sequentially swapping colored tokens on graphs
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Reconfiguring spanning and induced subgraphs
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Complexity of tiling a polygon with trominoes or bars
Discrete & Computational Geometry | 2017-10-25 | Paper |
On the parameterized complexity of reconfiguration problems
Algorithmica | 2017-05-11 | Paper |
The complexity of (list) edge-coloring reconfiguration problem
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Sequentially swapping colored tokens on graphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Composite-particles (boson, fermion) theory of fractional quantum Hall effect
International Journal of Theoretical Physics | 2017-03-24 | Paper |
Theory of the half-integer quantum Hall effect in graphene
International Journal of Theoretical Physics | 2017-03-24 | Paper |
The complexity of dominating set reconfiguration
Theoretical Computer Science | 2017-03-16 | Paper |
A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Discrete comprehensive Gröbner bases
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Reconfiguration of dominating sets
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
The complexity of dominating set reconfiguration
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Competitive diffusion on weighted graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Identities for entropy change associated with the time-evolution of an open system
Foundations of Physics | 2015-09-04 | Paper |
Swapping labeled tokens on graphs
Theoretical Computer Science | 2015-05-26 | Paper |
Computing gröbner bases within linear algebra and its implementation
ACM Communications in Computer Algebra | 2015-02-26 | Paper |
Reconfiguration of dominating sets
Lecture Notes in Computer Science | 2014-09-26 | Paper |
On the Parameterized Complexity for Token Jumping on Graphs
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Energy and fan-in of logic circuits computing symmetric Boolean functions
Theoretical Computer Science | 2014-01-16 | Paper |
On the parameterized complexity of reconfiguration problems
Lecture Notes in Computer Science | 2013-12-10 | Paper |
On van Hove singularities in pure cubic crystals
Modern Physics Letters B | 2013-11-29 | Paper |
On the rainbow connectivity of graphs: complexity and FPT algorithms
Algorithmica | 2013-11-11 | Paper |
Energy-efficient threshold circuits computing MOD functions
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
On the minimum caterpillar problem in digraphs
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Energy-efficient threshold circuits detecting global pattern in 1-dimentional arrays
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Computation of inverses in residue class rings of parametric polynomial ideals
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
Quantization and instability of the damped harmonic oscillator subject to a time-dependent force
Annals of Physics | 2011-12-23 | Paper |
On the rainbow connectivity of graphs: complexity and FPT algorithms
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Energy and fan-in of threshold circuits computing mod functions
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Boolean Gröbner bases
Journal of Symbolic Computation | 2011-03-31 | Paper |
| Computing Boolean Gröbner bases within linear algebra | 2010-03-10 | Paper |
Computing Gröbner Bases within Linear Algebra
Computer Algebra in Scientific Computing | 2009-11-10 | Paper |
| Computer Algebra in Scientific Computing | 2006-07-07 | Paper |
Shape invariant potentials in SUSY quantum mechanics and periodic orbit theory
Journal of Physics A: Mathematical and General | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2151243 (Why is no real title available?) | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 2133397 (Why is no real title available?) | 2005-02-11 | Paper |
An alternative approach to comprehensive Gröbner bases
Journal of Symbolic Computation | 2004-08-20 | Paper |
| scientific article; zbMATH DE number 2034394 (Why is no real title available?) | 2004-01-28 | Paper |
| Gröbner bases in polynomial rings over von Neumann regular rings -- their applications. (Extended abstract) | 2001-11-04 | Paper |
No elementary embedding from v into v is definable from parameters
Journal of Symbolic Logic | 2000-10-22 | Paper |
Non-existence of generic elementary embeddings into the ground model
Tsukuba Journal of Mathematics | 1999-06-28 | Paper |
