| Generalized Edge-Colorings Of Weighted Graphs | 0 | 0.34 | 2016 |
| Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs | 0 | 0.34 | 2015 |
| Edge-Colorings of Weighted Graphs - (Extended Abstract). | 0 | 0.34 | 2015 |
| Bandwidth consecutive multicolorings of graphs. | 2 | 0.44 | 2014 |
| Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract). | 1 | 0.36 | 2014 |
| Spanning Distribution Forests of Graphs - (Extended Abstract). | 0 | 0.34 | 2014 |
| Partitioning Trees With Supply, Demand And Edge-Capacity | 7 | 0.52 | 2013 |
| Spanning Distribution Trees Of Graphs | 0 | 0.34 | 2013 |
| Parametric power supply networks | 5 | 0.43 | 2013 |
| Absolutely Secure Message Transmission using a Key Sharing Graph. | 0 | 0.34 | 2012 |
| Small grid drawings of planar graphs with balanced partition | 2 | 0.36 | 2012 |
| Minimum Cost Partitions of Trees with Supply and Demand | 5 | 0.43 | 2012 |
| Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. | 0 | 0.34 | 2011 |
| Small grid drawings of planar graphs with balanced bipartition | 2 | 0.39 | 2010 |
| Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions. | 1 | 0.37 | 2010 |
| Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids | 0 | 0.34 | 2009 |
| Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions | 0 | 0.34 | 2009 |
| Efficient Compression Of Web Graphs | 0 | 0.34 | 2009 |
| Approximability of partitioning graphs with supply and demand | 12 | 1.11 | 2008 |
| Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size | 3 | 0.48 | 2007 |
| Improvements of HITS Algorithms for Spam Links | 0 | 0.34 | 2007 |
| Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs | 0 | 0.34 | 2007 |
| Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size | 11 | 0.84 | 2006 |
| Best Security Index for Digital Fingerprinting | 3 | 0.54 | 2006 |
| Open rectangle-of-influence drawings of inner triangulated plane graphs | 0 | 0.34 | 2006 |
| Partitioning Trees of Supply and Demand | 12 | 0.94 | 2005 |
| Rectangle-of-Influence Drawings of Four-Connected Plane Graphs | 4 | 0.44 | 2005 |
| Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs | 10 | 0.64 | 2004 |
| Partitioning a weighted graph to connected subgraphs of almost uniform size | 2 | 0.47 | 2004 |
| Algorithms for Drawing Plane Graphs. | 0 | 0.34 | 2004 |
| Algorithms For Drawing Plane Graphs | 1 | 0.41 | 2004 |
| Cost Total Colorings of Trees. | 0 | 0.34 | 2004 |
| Characterization of optimal key set protocols | 6 | 0.54 | 2003 |
| A linear algorithm for compact box-drawings of trees | 1 | 0.35 | 2003 |
| List total colorings of series-parallel graphs | 7 | 0.62 | 2003 |
| Algorithms for the Multicolorings of Partial k-Trees | 0 | 0.34 | 2002 |
| Planar Reconfiguration Of Monotone Trees | 1 | 0.63 | 2002 |
| Labeling Points With Rectangles Of Various Shapes | 1 | 0.36 | 2002 |
| A complete characterization of a family of key exchange protocols | 9 | 0.89 | 2002 |
| Bend-Minimum Orthogonal Drawings of Plane 3-Graphs | 5 | 0.49 | 2002 |
| Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups | 0 | 0.34 | 2001 |
| Grid Drawings of 4-Connected Plane Graphs | 27 | 1.61 | 2001 |
| Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs | 2 | 0.60 | 2001 |
| Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition | 1 | 0.36 | 2001 |
| The edge-disjoint path problem is NP-complete for series-parallel graphs | 29 | 1.08 | 2001 |
| Box-Rectangular Drawings of Plane Graphs | 11 | 0.79 | 2000 |
| Finding Edge-Disjoint Paths in Partial k-Trees | 8 | 0.59 | 2000 |
| Finding Independent Spanning Trees in Partial k-Trees | 0 | 0.34 | 2000 |
| Labeling Points with Rectangles of Various Shapes | 4 | 0.46 | 2000 |
| Algorithms for generalized vertex-rankings of partial k-trees | 8 | 0.43 | 2000 |
