| Publication | Date of Publication | Type |
|---|
| A note on locating-dominating sets in twin-free graphs | 2024-12-02 | Paper |
| An adaptive kriging method for solving nonlinear inverse statistical problems | 2024-10-08 | Paper |
| Quantile-constrained Wasserstein projections for robust interpretability of numerical and machine learning models | 2024-08-30 | Paper |
| Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces | 2024-08-02 | Paper |
| Discussion of: ``Specifying prior distributions in reliability applications: towards new formal rules for informative prior elicitation? | 2024-07-30 | Paper |
| Bayesian gamma processes for optimizing condition-based maintenance under uncertainty | 2024-07-18 | Paper |
| A note on highly connected \(K_{2, \ell}\)-minor free graphs | 2024-05-21 | Paper |
| Metric Dimension Parameterized by Treewidth in Chordal Graphs | 2024-05-03 | Paper |
| Reconfiguration of spanning trees with degree constraint or diameter constraint | 2024-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6128581 | 2024-04-15 | Paper |
| Local Certification of Graph Decompositions and Applications to Minor-Free Classes | 2024-04-15 | Paper |
| What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs | 2024-03-26 | Paper |
| On the coalitional decomposition of parameters of interest | 2024-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192476 | 2024-02-12 | Paper |
| PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters | 2024-02-12 | Paper |
| PACE Solver Description: µSolver - Heuristic Track * | 2024-02-12 | Paper |
| Digraph redicolouring | 2024-02-05 | Paper |
| Token sliding on graphs of girth five | 2024-01-25 | Paper |
| Square Coloring Planar Graphs with Automatic Discharging | 2024-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179344 | 2023-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083430 | 2023-12-08 | Paper |
| Linear transformations between dominating sets in the TAR-model | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6087216 | 2023-11-14 | Paper |
| Feedback vertex set reconfiguration in planar graphs | 2023-10-26 | Paper |
| The smallest 5-chromatic tournament | 2023-10-23 | Paper |
| Reconfiguration of spanning trees with degree constraints or diameter constraints | 2023-09-27 | Paper |
| Extremal independent set reconfiguration | 2023-08-18 | Paper |
| Galactic token sliding | 2023-06-12 | Paper |
| Token sliding on graphs of girth five | 2023-05-05 | Paper |
| Recoloring Planar Graphs of Girth at Least Five | 2023-03-30 | Paper |
| Improved square coloring of planar graphs | 2023-02-21 | Paper |
| Reconfiguration of Spanning Trees with Many or Few Leaves | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875613 | 2023-02-03 | Paper |
| EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs | 2022-12-08 | Paper |
| BAYESIAN INFERENCE FOR INVERSE PROBLEMS OCCURRING IN UNCERTAINTY ANALYSIS | 2022-11-24 | Paper |
| Locating-dominating sets: from graphs to oriented graphs | 2022-11-02 | Paper |
| (Sub)linear kernels for edge modification problems toward structured graph classes | 2022-10-27 | Paper |
| The Perfect Matching Reconfiguration Problem | 2022-07-21 | Paper |
| TS-reconfiguration of dominating sets in circle and circular-arc graphs | 2022-05-20 | Paper |
| Chordal directed graphs are not \(\chi\)-bounded | 2022-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075761 | 2022-05-11 | Paper |
| A polynomial version of Cereceda's conjecture | 2022-04-27 | Paper |
| A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems | 2022-04-22 | Paper |
| Distributed algorithms for fractional coloring | 2022-03-22 | Paper |
| Short and local transformations between ($\Delta+1$)-colorings | 2022-03-16 | Paper |
| Improved square coloring of planar graphs | 2021-12-23 | Paper |
| Recolouring planar graphs of girth at least five | 2021-12-01 | Paper |
| Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs | 2021-11-17 | Paper |
| Metric dimension on sparse graphs and its applications to zero forcing sets | 2021-11-15 | Paper |
| Recoloring graphs of treewidth 2 | 2021-09-30 | Paper |
| On girth and the parameterized complexity of token sliding and Token Jumping | 2021-09-02 | Paper |
| Parameterized Complexity of Independent Set in H-Free Graphs. | 2021-08-04 | Paper |
| Packing and covering balls in graphs excluding a minor | 2021-08-03 | Paper |
| Frozen (Δ + 1)-colourings of bounded degree graphs | 2021-06-15 | Paper |
| Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy | 2021-04-08 | Paper |
| TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs | 2021-02-21 | Paper |
| Detecting and modeling critical dependence structures between random inputs of computer models | 2021-01-14 | Paper |
| Recoloring graphs of treewidth 2 | 2020-12-21 | Paper |
| Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces | 2020-12-04 | Paper |
| Distributed algorithms for fractional coloring | 2020-12-03 | Paper |
| Parameterized complexity of independent set in H-free graphs | 2020-08-12 | Paper |
| Approximating Shortest Connected Graph Transformation for Trees | 2020-07-20 | Paper |
| Surfaces have (asymptotic) dimension 2 | 2020-07-07 | Paper |
| A note on the simultaneous edge coloring | 2020-03-20 | Paper |
| Exact Distance Colouring in Trees | 2020-03-11 | Paper |
| Shortest reconfiguration of matchings | 2020-02-24 | Paper |
| Distributed coloring in sparse graphs with fewer colors | 2019-11-15 | Paper |
| Distributed Coloring in Sparse Graphs with Fewer Colors | 2019-09-19 | Paper |
| A proof of the Erdös-Sands-Sauer-Woodrow conjecture | 2019-07-17 | Paper |
| Linear transformations between colorings in chordal graphs | 2019-07-03 | Paper |
| On a conjecture of Mohar concerning Kempe equivalence of regular graphs | 2019-02-08 | Paper |
| Reconfiguration of graphs with connectivity constraints | 2019-01-15 | Paper |
| χ‐bounded families of oriented graphs | 2019-01-03 | Paper |
| Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy | 2018-11-29 | Paper |
| Redefining the maximum sustainable yield for the Schaefer population model including multiplicative environmental noise | 2018-10-22 | Paper |
| Frozen colourings of bounded degree graphs | 2018-10-11 | Paper |
| Reconfiguration of graphs with connectivity constraints | 2018-09-14 | Paper |
| On the Economic Efficiency of the Combinatorial Clock Auction | 2018-07-16 | Paper |
| Covariance constraints for stochastic inverse problems of computer models | 2018-06-09 | Paper |
| Approximation of Limit State Surfaces in Monotonic Monte Carlo Settings, with Applications to Classification | 2018-04-19 | Paper |
| Decomposition techniques applied to the clique-stable set separation problem | 2018-04-05 | Paper |
| Multicut Is FPT | 2018-02-22 | Paper |
| Token sliding on chordal graphs | 2018-01-04 | Paper |
| Computing maximum cliques in \(B_2\)-EPG graphs | 2018-01-04 | Paper |
| Recoloring graphs via tree decompositions | 2017-12-21 | Paper |
| Token jumping in minor-closed classes | 2017-11-22 | Paper |
| A Vizing-like theorem for union vertex-distinguishing edge coloring | 2017-10-17 | Paper |
| Colorful paths for 3-chromatic graphs | 2017-02-27 | Paper |
| The Erdös--Hajnal Conjecture for Long Holes and Antiholes | 2016-06-23 | Paper |
| Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction | 2016-01-08 | Paper |
| Fast recoloring of sparse graphs | 2015-12-11 | Paper |
| Identifying Codes in Hereditary Classes of Graphs and VC-Dimension | 2015-10-30 | Paper |
| VC-dimension and Erdős-Pósa property | 2015-08-05 | Paper |
| The Erdős-Hajnal conjecture for paths and antipaths | 2015-06-10 | Paper |
| Coalition Games on Interaction Graphs: A Horticultural Perspective | 2015-02-26 | Paper |
| Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs | 2015-01-13 | Paper |
| A Near-Optimal Mechanism for Impartial Selection | 2015-01-07 | Paper |
| Excluding cycles with a fixed number of chords | 2014-11-28 | Paper |
| Clique versus independent set | 2014-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419983 | 2014-06-11 | Paper |
| Multicut is FPT | 2014-06-05 | Paper |
| Reconfiguring Independent Sets in Cographs | 2014-06-05 | Paper |
| Brooks' theorem on powers of graphs | 2014-05-06 | Paper |
| Parameterized domination in circle graphs | 2014-03-25 | Paper |
| Recoloring bounded treewidth graphs | 2013-02-14 | Paper |
| Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints | 2013-01-16 | Paper |
| Estimating discrete Markov models from various incomplete data schemes | 2012-12-30 | Paper |
| Parameterized Domination in Circle Graphs | 2012-11-06 | Paper |
| Eliciting vague but proper maximal entropy priors in Bayesian experiments | 2012-09-23 | Paper |
| Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs | 2012-09-04 | Paper |
| A POLYNOMIAL KERNEL FOR MULTICUT IN TREES | 2012-04-24 | Paper |
| Reference priors of nuisance parameters in Bayesian sequential population analysis | 2010-07-30 | Paper |
| Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata | 2010-05-26 | Paper |
| Diagnostics of prior-data agreement in applied Bayesian analysis | 2009-10-21 | Paper |
| An alternative competing risk model to the Weibull distribution for modelling aging in lifetime data analysis | 2007-04-26 | Paper |
| A note on highly connected $K_{2,\ell}$-minor free graphs | N/A | Paper |
| Hoeffding decomposition of black-box models with dependent inputs | N/A | Paper |
| A Note on the Complexity of Graph Recoloring | N/A | Paper |
| Fast winning strategies for the attacker in eternal domination | N/A | Paper |
| Computing conservative probabilities of rare events with surrogates | N/A | Paper |
