| Publication | Date of Publication | Type |
|---|
Knot diagrams of treewidth two
(available as arXiv preprint) | 2022-12-21 | Paper |
Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
| The kaleidoscopic Game of Life | 2022-07-26 | Paper |
| Dispersing Obnoxious Facilities on a Graph | 2022-07-18 | Paper |
Cyclic lot-sizing problems with sequencing costs
Journal of Scheduling | 2021-12-13 | Paper |
Vessel velocity decisions in inland waterway transportation under uncertainty
European Journal of Operational Research | 2021-11-09 | Paper |
Dispersing obnoxious facilities on a graph
Algorithmica | 2021-06-11 | Paper |
Inland waterway efficiency through skipper collaboration and joint speed optimization
European Journal of Operational Research | 2021-06-07 | Paper |
On the status sequences of trees
Theoretical Computer Science | 2021-01-19 | Paper |
Combinatorial properties and recognition of unit square visibility graphs
(available as arXiv preprint) | 2020-05-26 | Paper |
Scheduling unit-length jobs with precedence constraints of small height
Operations Research Letters | 2018-08-27 | Paper |
Complexity and approximability of the \(k\)-way vertex cut
Networks | 2018-05-11 | Paper |
Location, pricing and the problem of Apollonius
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
Computational Optimization and Applications | 2018-02-01 | Paper |
Location, pricing and the problem of Apollonius
Optimization Letters | 2017-12-15 | Paper |
A PTAS for the Cluster Editing Problem on Planar Graphs
Approximation and Online Algorithms | 2017-04-04 | Paper |
A Note on the Minimum H-Subgraph Edge Deletion
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
On low treewidth graphs and supertrees
Journal of Graph Algorithms and Applications | 2015-08-25 | Paper |
On time-optimal trajectories in non-uniform mediums
Journal of Optimization Theory and Applications | 2015-06-05 | Paper |
| Explicit-implicit splitting schemes for some systems of evolutionary equations | 2015-04-23 | Paper |
Bidimensionality of geometric intersection graphs
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
| Tree-width and large grid minors in planar graphs | 2014-03-25 | Paper |
On the complexity of a bundle pricing problem
4OR | 2012-01-10 | Paper |
How to Cut a Graph into Many Pieces
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Price strategy implementation
Computers & Operations Research | 2010-10-15 | Paper |
Algorithms for the minimum edge cover of \(H\)-subgraphs of a graph
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
On the complexity of the highway pricing problem
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Connected feedback vertex set in planar graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Scheduling jobs with time-resource tradeoff via nonlinear programming
Discrete Optimization | 2009-11-23 | Paper |
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry | 2009-08-14 | Paper |
Optimal pricing of capacitated networks
Networks | 2009-07-28 | Paper |
The Valve Location Problem in Simple Network Topologies
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Optimal bundle pricing with monotonicity constraint
Operations Research Letters | 2008-11-27 | Paper |
Bundle Pricing with Comparable Items
Algorithms – ESA 2007 | 2008-09-25 | Paper |
How to Sell a Graph: Guidelines for Graph Retailers
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Treewidth lower bounds with brambles
Algorithmica | 2008-05-27 | Paper |
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
Approximation and Online Algorithms | 2008-02-21 | Paper |
Pricing bridges to cross a river
Naval Research Logistics | 2008-01-18 | Paper |
Algorithms for graphs embeddable with few crossings per edge
Algorithmica | 2007-11-28 | Paper |
Multiplicity and complexity issues in contemporary production scheduling
Statistica Neerlandica | 2007-10-26 | Paper |
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
The geometric generalized minimum spanning tree problem with grid clustering
4OR | 2007-05-24 | Paper |
Machine scheduling with resource dependent processing times
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On the high multiplicity traveling salesman problem
Discrete Optimization | 2006-06-30 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Modeling and solving the periodic maintenance problem
European Journal of Operational Research | 2006-05-16 | Paper |
Basic scheduling problems with raw material constraints
Naval Research Logistics | 2006-01-23 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
A framework for the complexity of high-multiplicity scheduling problems
Journal of Combinatorial Optimization | 2005-10-18 | Paper |
Quantum theory of neutrino spin-light in matter
Gravitation & Cosmology | 2005-10-17 | Paper |
SPIN LIGHT OF NEUTRINO IN GRAVITATIONAL FIELDS
International Journal of Modern Physics D | 2005-06-07 | Paper |
Project scheduling with irregular costs: complexity, approximability, and algorithms
Acta Informatica | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 1979515 (Why is no real title available?) | 2003-09-14 | Paper |
