| Publication | Date of Publication | Type |
|---|
Generalized edge-rankings of trees (extended abstract)
| 2024-06-05 | Paper |
Rectangular grid drawings of plane graphs
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Simple reduction of f-colorings to edge-colorings
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Algorithms for finding f-colorings of partial k-trees
| 2023-03-21 | Paper |
Finding a shortest pair of paths on the plane with obstacles and crossing areas
| 2023-03-21 | Paper |
Finding edge-disjoint paths in partial k-trees
| 2023-01-25 | Paper |
A parallel algorithm for edge-coloring partial k-trees
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
scientific article; zbMATH DE number 6863596 (Why is no real title available?)
| 2018-04-23 | Paper |
A linear-time algorithm for four-partitioning four-connected planar graphs
Information Processing Letters | 2016-05-26 | Paper |
Generalized edge-colorings of weighted graphs
Discrete Mathematics, Algorithms and Applications | 2016-04-12 | Paper |
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
Theoretical Computer Science | 2015-12-08 | Paper |
Parametric power supply networks
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
A linear-time algorithm to find four independent spanning trees in four connected planar graphs
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Edge-colorings of weighted graphs (extended abstract)
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Spanning distribution forests of graphs (extended abstract)
Frontiers in Algorithmics | 2014-09-02 | Paper |
Approximation algorithms for bandwidth consecutive multicolorings (extended abstract)
Frontiers in Algorithmics | 2014-09-02 | Paper |
Bandwidth consecutive multicolorings of graphs
Theoretical Computer Science | 2014-04-15 | Paper |
Spanning distribution trees of graphs (extended abstract)
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Parametric power supply networks (extended abstract)
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Minimum cost partitions of trees with supply and demand
Algorithmica | 2013-01-28 | Paper |
Absolutely secure message transmission using a key sharing graph
Discrete Mathematics, Algorithms and Applications | 2013-01-24 | Paper |
Small grid drawings of planar graphs with balanced partition
Journal of Combinatorial Optimization | 2012-12-21 | Paper |
Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract)
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Partitioning a weighted tree into subtrees with weights in a given range
Algorithmica | 2012-04-26 | Paper |
Minimizing AND-EXOR expressions for two-variable multiple-valued input binary output functions
| 2012-04-26 | Paper |
Energy and depth of threshold circuits
Theoretical Computer Science | 2012-04-03 | Paper |
List total colorings of series-parallel graphs
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
Theoretical Computer Science | 2011-02-21 | Paper |
Convex drawings of internally triconnected plane graphs on \(O(n^{2})\) grids
Discrete Mathematics, Algorithms and Applications | 2010-12-15 | Paper |
Minimum Cost Partitions of Trees with Supply and Demand
Algorithms and Computation | 2010-12-09 | Paper |
Minimum cost edge-colorings of trees can be reduced to matchings
Frontiers in Algorithmics | 2010-09-07 | Paper |
Partitioning graphs of supply and demand
Discrete Applied Mathematics | 2010-04-28 | Paper |
Small grid drawings of planar graphs with balanced bipartition
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
Algorithms and Computation | 2009-12-17 | Paper |
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Energy Complexity and Depth of Threshold Circuits
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Size and Energy of Threshold Circuits Computing Mod Functions
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Open rectangle-of-influence drawings of inner triangulated plane graphs
Discrete \& Computational Geometry | 2009-05-06 | Paper |
Approximability of partitioning graphs with supply and demand
Journal of Discrete Algorithms | 2009-02-23 | Paper |
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry | 2009-02-12 | Paper |
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
Algorithms and Computation | 2009-01-29 | Paper |
Convex Grid Drawings of Plane Graphs with Rectangular Contours
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Efficient Compression of Web Graphs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Convex Grid Drawings of Plane Graphs with Rectangular Contours
Algorithms and Computation | 2008-04-24 | Paper |
Approximability of Partitioning Graphs with Supply and Demand
Algorithms and Computation | 2008-04-24 | Paper |
A revised transformation protocol for unconditionally secure secret key exchange
Theory of Computing Systems | 2008-04-03 | Paper |
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Total colorings of degenerate graphs
Combinatorica | 2007-11-12 | Paper |
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
Graph Drawing | 2007-08-28 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
International Journal of Foundations of Computer Science | 2006-10-16 | Paper |
CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
International Journal of Foundations of Computer Science | 2006-10-16 | Paper |
INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
PARTITIONING TREES OF SUPPLY AND DEMAND
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Orthogonal Drawings of Plane Graphs Without Bends
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
International Journal of Foundations of Computer Science | 2005-05-06 | Paper |
List total colorings of series-parallel graphs
Journal of Discrete Algorithms | 2005-05-04 | Paper |
Algorithm for the cost edge-coloring of trees
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
scientific article; zbMATH DE number 2123122 (Why is no real title available?)
| 2004-12-16 | Paper |
Multicolorings of series-parallel graphs
Algorithmica | 2004-12-02 | Paper |
Rectangular drawings of planar graphs
Journal of Algorithms | 2004-10-04 | Paper |
LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
scientific article; zbMATH DE number 2089998 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2084292 (Why is no real title available?)
| 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080089 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080991 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080251 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080244 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2081017 (Why is no real title available?)
| 2004-08-04 | Paper |
A linear algorithm for compact box-drawings of trees
Networks | 2003-10-29 | Paper |
Characterization of optimal key set protocols
Discrete Applied Mathematics | 2003-09-25 | Paper |
scientific article; zbMATH DE number 1979534 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1974124 (Why is no real title available?)
| 2003-09-03 | Paper |
scientific article; zbMATH DE number 1974125 (Why is no real title available?)
| 2003-09-03 | Paper |
Finding a region with the minimum total \(L_1\) distance from prescribed terminals
Algorithmica | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1953108 (Why is no real title available?)
| 2003-07-25 | Paper |
Finding a noncrossing Steiner forest in plane graphs under a 2-face condition
Journal of Combinatorial Optimization | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1759477 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1796973 (Why is no real title available?)
| 2002-09-05 | Paper |
scientific article; zbMATH DE number 1788708 (Why is no real title available?)
| 2002-08-26 | Paper |
scientific article; zbMATH DE number 1696625 (Why is no real title available?)
| 2002-07-01 | Paper |
scientific article; zbMATH DE number 1754616 (Why is no real title available?)
| 2002-06-12 | Paper |
Rectangular drawings of plane graphs without designated corners
Computational Geometry | 2002-05-20 | Paper |
The edge-disjoint paths problem is NP-complete for series-parallel graphs
Discrete Applied Mathematics | 2002-04-22 | Paper |
Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
Journal of Combinatorial Theory. Series B | 2002-03-14 | Paper |
Grid drawings of 4-connected plane graphs
Discrete \& Computational Geometry | 2002-01-21 | Paper |
scientific article; zbMATH DE number 1925555 (Why is no real title available?)
International Journal of Information Security | 2002-01-01 | Paper |
A linear algorithm for finding \([g,f\)-colorings of partial \(k\)-trees]
Algorithmica | 2001-10-30 | Paper |
scientific article; zbMATH DE number 1522940 (Why is no real title available?)
| 2001-03-06 | Paper |
scientific article; zbMATH DE number 1568065 (Why is no real title available?)
| 2001-02-21 | Paper |
scientific article; zbMATH DE number 1522942 (Why is no real title available?)
| 2001-02-12 | Paper |
scientific article; zbMATH DE number 1500679 (Why is no real title available?)
| 2001-01-29 | Paper |
scientific article; zbMATH DE number 1555935 (Why is no real title available?)
| 2001-01-24 | Paper |
Box-Rectangular Drawings of Plane Graphs
Journal of Algorithms | 2000-12-19 | Paper |
A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
scientific article; zbMATH DE number 1303036 (Why is no real title available?)
| 2000-11-06 | Paper |
scientific article; zbMATH DE number 1263286 (Why is no real title available?)
| 2000-10-10 | Paper |
A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
Journal of Graph Algorithms and Applications | 2000-09-19 | Paper |
Algorithms for generalized vertex-rankings of partial k-trees
Theoretical Computer Science | 2000-08-21 | Paper |
scientific article; zbMATH DE number 1304085 (Why is no real title available?)
| 2000-03-07 | Paper |
scientific article; zbMATH DE number 1263265 (Why is no real title available?)
| 1999-11-03 | Paper |
scientific article; zbMATH DE number 1262791 (Why is no real title available?)
| 1999-07-05 | Paper |
scientific article; zbMATH DE number 1301090 (Why is no real title available?)
| 1999-06-15 | Paper |
Edge-Coloring and f-Coloring for Various Classes of Graphs
Journal of Graph Algorithms and Applications | 1999-05-18 | Paper |
Edge-Coloring Problems for Graphs.
Interdisciplinary Information Sciences | 1999-04-29 | Paper |
scientific article; zbMATH DE number 1262807 (Why is no real title available?)
| 1999-03-15 | Paper |
scientific article; zbMATH DE number 1222849 (Why is no real title available?)
| 1999-02-14 | Paper |
Rectangular grid drawings of plane graphs
Computational Geometry | 1998-11-19 | Paper |
scientific article; zbMATH DE number 1088275 (Why is no real title available?)
| 1998-02-23 | Paper |
Shortest Non-Crossing Rectilinear Paths in Plane Regions
International Journal of Computational Geometry & Applications | 1998-02-02 | Paper |
An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs
Journal of Algorithms | 1997-11-10 | Paper |
Edge-Coloring Partialk-Trees
Journal of Algorithms | 1996-12-08 | Paper |
scientific article; zbMATH DE number 910867 (Why is no real title available?)
| 1996-09-23 | Paper |
A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
Journal of Algorithms | 1996-02-20 | Paper |
EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
International Journal of Computational Geometry & Applications | 1995-03-01 | Paper |
\(k\)-connectivity and decomposition of graphs into forests
Discrete Applied Mathematics | 1995-02-01 | Paper |
scientific article; zbMATH DE number 432791 (Why is no real title available?)
| 1994-09-20 | Paper |
SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
International Journal of Foundations of Computer Science | 1994-04-27 | Paper |
Planar graphs: Theory and algorithms
Annals of Discrete Mathematics | 1993-06-05 | Paper |
Multiple assignment scheme for sharing secret
Journal of Cryptology | 1993-05-16 | Paper |
Algorithms for routing around a rectangle
Discrete Applied Mathematics | 1993-05-16 | Paper |
Variable-priority queue and doughnut routing
Journal of Algorithms | 1993-01-12 | Paper |
A linear algorithm for bipartition of biconnected graphs
Information Processing Letters | 1990-01-01 | Paper |
On the $1.1$ Edge-Coloring of Multigraphs
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4189751 (Why is no real title available?)
| 1990-01-01 | Paper |
Improved edge-coloring algorithms for planar graphs
Journal of Algorithms | 1990-01-01 | Paper |
Edge-disjoint paths in a grid bounded by two nested rectangles
Discrete Applied Mathematics | 1990-01-01 | Paper |
On the fg-coloring of graphs
Combinatorica | 1990-01-01 | Paper |
The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
Journal of Algorithms | 1989-01-01 | Paper |
Algorithms for multicommodity flows in planar graphs
Algorithmica | 1989-01-01 | Paper |
On the f-coloring of multigraphs
IEEE Transactions on Circuits and Systems | 1988-01-01 | Paper |
A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms | 1986-01-01 | Paper |
A theorem on paths in planar graphs
Journal of Graph Theory | 1986-01-01 | Paper |
Planar Multicommodity Fows, Maximum Matchings and Negative Cycles
SIAM Journal on Computing | 1986-01-01 | Paper |
A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Arboricity and Subgraph Listing Algorithms
SIAM Journal on Computing | 1985-01-01 | Paper |
Lower bounds for combinatorial problems on graphs
Journal of Algorithms | 1985-01-01 | Paper |
Drawing plane graphs nicely
Acta Informatica | 1985-01-01 | Paper |
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
SIAM Journal on Computing | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3918395 (Why is no real title available?)
| 1985-01-01 | Paper |
A note on nongraphic matroids
Journal of Combinatorial Theory. Series B | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3885930 (Why is no real title available?)
| 1984-01-01 | Paper |
A note on the critical problem for matroids
European Journal of Combinatorics | 1984-01-01 | Paper |
An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
Discrete Applied Mathematics | 1983-01-01 | Paper |
An algorithm for finding a large independent set in planar graphs
Networks | 1983-01-01 | Paper |
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs
SIAM Journal on Computing | 1982-01-01 | Paper |
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM | 1982-01-01 | Paper |
Combinatorial problems on series-parallel graphs
Discrete Applied Mathematics | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3750313 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3729461 (Why is no real title available?)
| 1981-01-01 | Paper |
A linear 5-coloring algorithm of planar graphs
Journal of Algorithms | 1981-01-01 | Paper |
On the maximum matchings of regular multigraphs
Discrete Mathematics | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3728317 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3694608 (Why is no real title available?)
| 1980-01-01 | Paper |
An algorithm for finding a short closed spanning walk in a graph
Networks | 1980-01-01 | Paper |
An upper bound on the length of a Hamiltonian walk of a maximal planar graph
Journal of Graph Theory | 1980-01-01 | Paper |
A 1-tough nonhamiltonian maximal planar graph
Discrete Mathematics | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3694607 (Why is no real title available?)
| 1980-01-01 | Paper |
Lower bounds on the cardinality of the maximum matchings of planar graphs
Discrete Mathematics | 1979-01-01 | Paper |
On the relationship between the genus and the cardinality of the maximum matchings of a graph
Discrete Mathematics | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3641462 (Why is no real title available?)
| 1978-01-01 | Paper |
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade
Journal of Combinatorial Theory. Series B | 1978-01-01 | Paper |
