| Publication | Date of Publication | Type |
|---|
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants | 2024-05-06 | Paper |
| Grouped domination parameterized by vertex cover, twin cover, and beyond | 2024-04-04 | Paper |
| Winner determination algorithms for graph games with matching structures | 2024-03-25 | Paper |
| Safe sets and in-dominating sets in digraphs | 2024-02-14 | Paper |
| An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs | 2023-11-13 | Paper |
| Grouped domination parameterized by vertex cover, twin cover, and beyond | 2023-10-04 | Paper |
| Sequentially swapping tokens: further on graph classes | 2023-08-14 | Paper |
| Reallocation problems with minimum completion time | 2023-08-10 | Paper |
| Fair ride allocation on a line | 2023-07-28 | Paper |
| Reconfiguration of cliques in a graph | 2023-04-27 | Paper |
| Computing L(p,1)-Labeling with Combined Parameters | 2022-11-14 | Paper |
| Parameterized Complexity of $$(A,\ell )$$-Path Packing | 2022-10-13 | Paper |
| The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality | 2022-09-15 | Paper |
| Winner determination algorithms for graph games with matching structures | 2022-08-30 | Paper |
| Parameterized complexity of \((A,\ell)\)-path packing | 2022-03-22 | Paper |
| Upper and lower degree-constrained graph orientation with minimum penalty | 2021-12-22 | Paper |
| Computing \(L(p, 1)\)-labeling with combined parameters | 2021-10-04 | Paper |
| Graph orientation with edge modifications | 2021-04-19 | Paper |
| Settlement Fund Circulation Problem | 2020-11-25 | Paper |
| On directed covering and domination problems | 2020-11-25 | Paper |
| A 116/13-approximation algorithm for \(L(2,1)\)-labeling of unit disk graphs | 2020-10-22 | Paper |
| Graph orientation with splits | 2020-10-21 | Paper |
| Parameterized complexity of safe set | 2020-09-04 | Paper |
| Exact algorithms for the repetition-bounded longest common subsequence problem | 2020-09-01 | Paper |
| Space-efficient algorithms for longest increasing subsequence | 2020-08-05 | Paper |
| Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium | 2020-07-20 | Paper |
| Parameterized complexity of independent set reconfiguration problems | 2020-06-29 | Paper |
| Exact algorithms for the bounded repetition longest common subsequence problem | 2020-05-13 | Paper |
| Space-efficient algorithms for longest increasing subsequence | 2020-04-15 | Paper |
| Parameterized complexity of safe set | 2020-02-06 | Paper |
| On the maximum weight minimal separator | 2019-11-13 | Paper |
| Optimal partition of a tree with social distance | 2019-10-15 | Paper |
| Graph orientation with edge modifications | 2019-10-11 | Paper |
| Settlement fund circulation problem | 2019-07-17 | Paper |
| On directed covering and domination problems | 2019-03-28 | Paper |
| Safe sets in graphs: graph classes and structural parameters | 2018-12-06 | Paper |
| Graph orientation with splits | 2018-08-17 | Paper |
| Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity | 2018-07-25 | Paper |
| Subexponential fixed-parameter algorithms for partial vector domination | 2018-05-24 | Paper |
| Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity | 2018-04-19 | Paper |
| A faster parameterized algorithm for pseudoforest deletion | 2018-04-10 | Paper |
| A faster parameterized algorithm for pseudoforest deletion | 2018-01-11 | Paper |
| A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection | 2017-12-01 | Paper |
| On the maximum weight minimal separator | 2017-05-19 | Paper |
| An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication | 2017-05-19 | Paper |
| The complexity of dominating set reconfiguration | 2017-03-16 | Paper |
| (Total) vector domination for graphs with bounded branchwidth | 2016-06-01 | Paper |
| Degree-constrained graph orientation: maximum satisfaction and minimum violation | 2016-03-21 | Paper |
| The complexity of dominating set reconfiguration | 2015-10-30 | Paper |
| Graph orientations optimizing the number of light or heavy vertices | 2015-10-29 | Paper |
| Subexponential fixed-parameter algorithms for partial vector domination | 2015-10-16 | Paper |
| Reconfiguration of cliques in a graph | 2015-09-30 | Paper |
| Deductive inference for the interiors and exteriors of Horn theories | 2015-09-17 | Paper |
| Linear-time algorithm for sliding tokens on trees | 2015-09-16 | Paper |
| Fixed-parameter tractability of token jumping on planar graphs | 2015-09-11 | Paper |
| Polynomial-time algorithm for sliding tokens on trees | 2015-09-11 | Paper |
| Depth-First Search Using $$O(n)$$ Bits | 2015-09-11 | Paper |
| The searchlight problem for road networks | 2015-07-13 | Paper |
| Approximability of minimum certificate dispersal with tree structures | 2015-07-13 | Paper |
| Pattern formation by oblivious asynchronous mobile robots | 2015-06-24 | Paper |
| Coalescing random walks and voting on graphs | 2014-12-05 | Paper |
| Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances | 2014-12-02 | Paper |
| Base-object location problems for base-monotone regions | 2014-10-06 | Paper |
| Degree-constrained graph orientation: maximum satisfaction and minimum violation | 2014-09-02 | Paper |
| Reconfiguration of list \(L(2,1)\)-labelings in a graph | 2014-07-07 | Paper |
| On the Parameterized Complexity for Token Jumping on Graphs | 2014-04-16 | Paper |
| Coalescing random walks and voting on connected graphs | 2014-04-10 | Paper |
| Optimal approximability of bookmark assignments | 2014-04-10 | Paper |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes | 2014-04-02 | Paper |
| (Total) vector domination for graphs with bounded branchwidth | 2014-03-31 | Paper |
| How to collect balls moving in the Euclidean plane | 2013-08-30 | Paper |
| A linear time algorithm for \(L(2,1)\)-labeling of trees | 2013-06-25 | Paper |
| Base Location Problems for Base-Monotone Regions | 2013-04-12 | Paper |
| Reconfiguration of list \(L(2,1)\)-labelings in a graph | 2013-03-21 | Paper |
| Route-enabling graph orientation problems | 2013-03-05 | Paper |
| On space complexity of self-stabilizing leader election in mediated population protocol | 2013-02-04 | Paper |
| Graph orientations optimizing the number of light or heavy vertices | 2012-11-02 | Paper |
| A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs | 2012-09-13 | Paper |
| Finding longest common segments in protein structures in nearly linear time | 2012-08-14 | Paper |
| Minimum certificate dispersal with tree structures | 2012-07-16 | Paper |
| On the approximability and hardness of minimum topic connected overlay and its special instances | 2012-05-30 | Paper |
| The \((p,q)\)-total labeling problem for trees | 2012-03-29 | Paper |
| Approximability of the path-distance-width for AT-free graphs | 2011-12-16 | Paper |
| On the approximability of minimum topic connected overlay and its special instances | 2011-08-17 | Paper |
| Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree | 2011-06-17 | Paper |
| The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\) | 2011-05-19 | Paper |
| Graph orientation to maximize the minimum weighted outdegree | 2011-05-10 | Paper |
| Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree | 2011-04-19 | Paper |
| Broadcastings and digit tilings on three-dimensional torus networks | 2011-02-02 | Paper |
| The (p,q)-total Labeling Problem for Trees | 2010-12-09 | Paper |
| Approximability and inapproximability of the minimum certificate dispersal problem | 2010-07-07 | Paper |
| The space complexity of leader election in anonymous networks | 2010-06-18 | Paper |
| Local move connectedness of domino tilings with diagonal impurities | 2010-05-28 | Paper |
| The hitting and cover times of Metropolis walks | 2010-04-15 | Paper |
| Route-enabling graph orientation problems | 2009-12-17 | Paper |
| A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems | 2009-11-19 | Paper |
| How to Design a Linear Cover Time Random Walk on a Finite Graph | 2009-11-19 | Paper |
| A Linear Time Algorithm for L(2,1)-Labeling of Trees | 2009-10-29 | Paper |
| An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees | 2009-09-10 | Paper |
| Drawing borders efficiently | 2009-08-06 | Paper |
| Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem | 2009-07-23 | Paper |
| Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG | 2009-06-03 | Paper |
| Deductive Inference for the Interiors and Exteriors of Horn Theories | 2009-01-29 | Paper |
| The Balanced Edge Cover Problem | 2009-01-29 | Paper |
| On Approximation of Bookmark Assignments | 2008-09-17 | Paper |
| An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees | 2008-07-15 | Paper |
| DNA Sequence Design by Dynamic Neighborhood Searches | 2008-04-04 | Paper |
| A Probabilistic Model of the DNA Conformational Change | 2008-04-04 | Paper |
| Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree | 2008-01-04 | Paper |
| Drawing Borders Efficiently | 2007-11-15 | Paper |
| GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE | 2007-04-25 | Paper |
| How to collect balls moving in the Euclidean plane | 2007-01-09 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| A decomposability index in logical analysis of data | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474096 | 2004-08-04 | Paper |
| Interior and exterior functions of positive Boolean functions. | 2003-09-22 | Paper |
| Logical analysis of data with decomposable structures. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766849 | 2002-07-22 | Paper |
| An improved spectral lower bound of treewidth | N/A | Paper |
