| Publication | Date of Publication | Type |
|---|
A characterization of Seymour graphs
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Complexity of the weighted max-cut in Euclidean space
Journal of Applied and Industrial Mathematics | 2015-07-27 | Paper |
NP-hardness of the Euclidean Max-Cut problem
Doklady Mathematics | 2014-11-14 | Paper |
| A 2-approximation algorithm for the metric 2-peripatetic salesman problem | 2012-02-20 | Paper |
| A polynomial algorithm for solving the facility location problem on a chain network with identical plant production capacities | 2012-02-20 | Paper |
| An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays | 2012-02-10 | Paper |
| scientific article; zbMATH DE number 6004865 (Why is no real title available?) | 2012-02-10 | Paper |
| Metric location problems with nonshortest service routes | 2012-02-10 | Paper |
Computational complexity of the graph approximation problem
Journal of Applied and Industrial Mathematics | 2012-02-10 | Paper |
An Excluded Minor Characterization of Seymour Graphs
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Approximation Algorithms for Scheduling Problems with Exact Delays
Approximation and Online Algorithms | 2008-02-21 | Paper |
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
Approximation and Online Algorithms | 2008-02-20 | Paper |
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
Approximation algorithms for UET scheduling problems with exact delays
Operations Research Letters | 2007-10-30 | Paper |
Open block scheduling in optical communication networks
Theoretical Computer Science | 2006-09-14 | Paper |
Improved Combinatorial Approximation Algorithms for the <i>k</i>-Level Facility Location Problem
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Pipage rounding: a new method of constructing algorithms with proven performance guarantee
Journal of Combinatorial Optimization | 2004-11-22 | Paper |
| scientific article; zbMATH DE number 2102648 (Why is no real title available?) | 2004-09-23 | Paper |
| scientific article; zbMATH DE number 2038706 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1947043 (Why is no real title available?) | 2003-07-07 | Paper |
Improved approximation algorithms for multilevel facility location problems
Operations Research Letters | 2003-04-02 | Paper |
Vertex set partitions preserving conservativeness
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Complexity of finding a join of maximum weight
Discrete Applied Mathematics | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1670527 (Why is no real title available?) | 2002-01-06 | Paper |
| scientific article; zbMATH DE number 1670644 (Why is no real title available?) | 2001-12-18 | Paper |
A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1342117 (Why is no real title available?) | 2000-11-27 | Paper |
Every circle graph of girth at least 5 is 3-colourable
Discrete Mathematics | 2000-04-10 | Paper |
| scientific article; zbMATH DE number 1405804 (Why is no real title available?) | 2000-02-23 | Paper |
An 0. 828-approximation algorithm for the uncapacitated facility location problem
Discrete Applied Mathematics | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1099637 (Why is no real title available?) | 1998-01-05 | Paper |
| A characterization of Seymour graphs | 1997-08-31 | Paper |
A triangle-free circle graph with chromatic number 5
Discrete Mathematics | 1997-01-13 | Paper |
Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
Siberian Mathematical Journal | 1996-11-25 | Paper |
Complexity of the network median problem on planar grids
Siberian Advances in Mathematics | 1996-08-20 | Paper |
| scientific article; zbMATH DE number 706867 (Why is no real title available?) | 1995-06-12 | Paper |
Sierpinski's Theorem is Deducible from Euler and Dirichlet
The American Mathematical Monthly | 1995-03-02 | Paper |
On Finding Critical Independent and Vertex Sets
SIAM Journal on Discrete Mathematics | 1994-10-20 | Paper |
| scientific article; zbMATH DE number 4193457 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4147860 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3914086 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3867065 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3847216 (Why is no real title available?) | 1981-01-01 | Paper |
