Takao Nishizeki
According to our database^{1},
Takao Nishizeki
authored at least 205 papers
between 1978 and 2016.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 1996, "For contributions to the design and analysis of efficient algorithms for planar graphs, network flows and VLSI routing.".
IEEE Fellow
IEEE Fellow 1995, "For contributions to graph algorithms with applications to physical design of electronic systems.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at viaf.org

at isni.org

at id.loc.gov

at dnb.info

at dl.acm.org
On csauthors.net:
Bibliography
2016
Generalized edgecolorings of weighted graphs.
Discrete Math., Alg. and Appl., 2016
2015
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs.
Theor. Comput. Sci., 2015
Parametric power supply networks.
J. Comb. Optim., 2015
EdgeColorings of Weighted Graphs  (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation  9th International Workshop, 2015
2014
Bandwidth consecutive multicolorings of graphs.
Theor. Comput. Sci., 2014
Spanning Distribution Trees of Graphs.
IEICE Transactions, 2014
Approximation Algorithms for Bandwidth Consecutive Multicolorings  (Extended Abstract).
Proceedings of the Frontiers in Algorithmics  8th International Workshop, 2014
Spanning Distribution Forests of Graphs  (Extended Abstract).
Proceedings of the Frontiers in Algorithmics  8th International Workshop, 2014
2013
Rectangular Drawing Algorithms.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013
Partitioning Trees with Supply, Demand and EdgeCapacity.
IEICE Transactions, 2013
Parametric Power Supply Networks.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
Spanning Distribution Trees of Graphs.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013
2012
Small grid drawings of planar graphs with balanced partition.
J. Comb. Optim., 2012
Absolutely Secure Message Transmission using a Key Sharing Graph.
Discrete Math., Alg. and Appl., 2012
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.
Algorithmica, 2012
Minimum Cost Partitions of Trees with Supply and Demand.
Algorithmica, 2012
Algorithms for Bandwidth Consecutive Multicolorings of Graphs  (Extended Abstract).
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012
2011
Sizeenergy tradeoffs for unate circuits computing symmetric Boolean functions.
Theor. Comput. Sci., 2011
Minimum Cost EdgeColorings of Trees Can Be Reduced to Matchings.
IEICE Transactions, 2011
2010
Energy and depth of threshold circuits.
Theor. Comput. Sci., 2010
Minimizing ANDEXOR Expressions for TwoVariable MultipleValued Input Binary Output Functions.
MultipleValued Logic and Soft Computing, 2010
Convex Drawings of Internally Triconnected Plane Graphs on O(N^{2}) Grids.
Discrete Math., Alg. and Appl., 2010
Small Grid Drawings of Planar Graphs with Balanced Bipartition.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010
Minimum Cost Partitions of Trees with Supply and Demand.
Proceedings of the Algorithms and Computation  21st International Symposium, 2010
Minimum Cost EdgeColorings of Trees Can Be Reduced to Matchings.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010
2009
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2009
Efficient Compression of Web Graphs.
IEICE Transactions, 2009
Open RectangleofInfluence Drawings of Inner Triangulated Plane Graphs.
Discrete & Computational Geometry, 2009
Partitioning graphs of supply and demand.
Discrete Applied Mathematics, 2009
Octagonal drawings of plane graphs with prescribed face areas.
Comput. Geom., 2009
Minimizing ANDEXOR Expressions for MultipleValued TwoInput Logic Functions.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
Size and Energy of Threshold Circuits Computing Mod Functions.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009
Convex Drawings of Internally Triconnected Plane Graphs on O(n^{2}) Grids.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Energy Complexity and Depth of Threshold Circuits.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009
2008
Orthogonal Drawings of SeriesParallel Graphs with Minimum Bends.
SIAM J. Discrete Math., 2008
A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange.
Theory Comput. Syst., 2008
Convex Grid Drawings of Plane Graphs with Rectangular Contours.
J. Graph Algorithms Appl., 2008
Approximability of partitioning graphs with supply and demand.
J. Discrete Algorithms, 2008
Improvements of HITS Algorithms for Spam Links.
IEICE Transactions, 2008
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Efficient Compression of Web Graphs.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
2007
Algorithms for finding distanceedgecolorings of graphs.
J. Discrete Algorithms, 2007
Sufficient Condition and Algorithm for List Total Colorings of SeriesParallel Graphs.
IEICE Transactions, 2007
Partitioning a MultiWeighted Graph to Connected Subgraphs of Almost Uniform Size.
IEICE Transactions, 2007
Total Colorings Of Degenerate Graphs.
Combinatorica, 2007
Orthogonal drawings of seriesparallel graphs with minimum bends.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007
Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007
Improvements of HITS Algorithms for Spam Links.
Proceedings of the Advances in Data and Web Management, 2007
2006
Partitioning a graph of bounded treewidth to connected subgraphs of almost uniform size.
J. Discrete Algorithms, 2006
Convex Grid Drawings of Fourconnected Plane Graphs.
Int. J. Found. Comput. Sci., 2006
Convex Drawings of Plane Graphs of Minimum Outer Apices.
Int. J. Found. Comput. Sci., 2006
Inner Rectangular Drawings of Plane Graphs.
Int. J. Comput. Geometry Appl., 2006
Best Security Index for Digital Fingerprinting.
IEICE Transactions, 2006
Mining Communities on the Web Using a MaxFlow and a SiteOriented Framework.
IEICE Transactions, 2006
Convex Grid Drawings of Plane Graphs with Rectangular Contours.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Approximability of Partitioning Graphs with Supply and Demand.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Open RectangleofInfluence Drawings of Inner Triangulated Plane Graphs.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006
Partitioning a Multiweighted Graph to Connected Subgraphs of Almost Uniform Size.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
List total colorings of seriesparallel graphs.
J. Discrete Algorithms, 2005
Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs.
Int. J. Found. Comput. Sci., 2005
Partitioning trees of supply and demand.
Int. J. Found. Comput. Sci., 2005
NoBend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs.
IEICE Transactions, 2005
Mining Communities on the Web Using a MaxFlow and a SiteOriented Framework.
Proceedings of the Web Information Systems Engineering, 2005
Partitioning graphs of supply and demand.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005
Orthogonal Drawings of SeriesParallel Graphs with Minimum Bends.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Best Security Index for Digital Fingerprinting.
Proceedings of the Information Hiding, 7th International Workshop, 2005
Nobend Orthogonal Drawings of SeriesParallel Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005
Convex Drawings of Plane Graphs of Minimum Outer Apices.
Proceedings of the Graph Drawing, 13th International Symposium, 2005
Algorithms for Finding DistanceEdgeColorings of Graphs.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
RectangleofInfluence Drawings of FourConnected Plane Graphs.
Proceedings of the AsiaPacific Symposium on Information Visualisation, 2005
2004
Algorithm for the Cost EdgeColoring of Trees.
J. Comb. Optim., 2004
Rectangular drawings of planar graphs.
J. Algorithms, 2004
Algorithms for Drawing Plane Graphs.
IEICE Transactions, 2004
Cost Total Colorings of Trees.
IEICE Transactions, 2004
Multicolorings of SeriesParallel Graphs.
Algorithmica, 2004
Octagonal Drawings of Plane Graphs with Prescribed Face Areas.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2004
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2004
Inner Rectangular Drawings of Plane Graphs.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004
Necessary and Sufficient Numbers of Cards for the Transformation Protocol.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004
Planar Graph Drawing
Lecture Notes Series on Computing 12, World Scientific, ISBN: 9812560335, 2004
2003
A linear algorithm for compact boxdrawings of trees.
Networks, 2003
Orthogonal Drawings of Plane Graphs Without Bends.
J. Graph Algorithms Appl., 2003
Characterization of optimal key set protocols.
Discrete Applied Mathematics, 2003
Drawing Plane Graphs.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
NoBend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs.
Proceedings of the Graph Drawing, 11th International Symposium, 2003
WebLinkage Viewer: Drawing Links in the Web Based on a SiteOriented Framework.
Proceedings of the Graph Drawing, 11th International Symposium, 2003
List Total Colorings of SeriesParallel Graphs.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2002
A complete characterization of a family of key exchange protocols.
Int. J. Inf. Sec., 2002
Labeling Points with Rectangles of Various Shapes.
Int. J. Comput. Geometry Appl., 2002
Rectangular drawings of plane graphs without designated corners.
Comput. Geom., 2002
BendMinimum Orthogonal Drawings of Plane 3Graphs.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2002
Partitioning Trees of Supply and Demand.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Rectangular Drawings of Planar Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002
Extended Rectangular Drawings of Plane Graphs with Designated Corners.
Proceedings of the Graph Drawing, 10th International Symposium, 2002
Algorithms for the Multicolorings of Partial kTrees.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002
A linear algorithm for compact boxdrawings of trees.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
2001
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2001
Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2Face Condition.
J. Comb. Optim., 2001
Grid Drawings of 4Connected Plane Graphs.
Discrete & Computational Geometry, 2001
The edgedisjoint paths problem is NPcomplete for seriesparallel graphs.
Discrete Applied Mathematics, 2001
Efficient Algorithms for Weighted Colorings of SeriesParallel Graphs.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
Total Colorings of Degenerated Graphs.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
Orthogonal Drawings of Plane Graphs without Bends.
Proceedings of the Graph Drawing, 9th International Symposium, 2001
Algorithm for the Cost EdgeColoring of Trees.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
Algorithms for generalized vertexrankings of partial ktrees.
Theor. Comput. Sci., 2000
BoxRectangular Drawings of Plane Graphs.
J. Algorithms, 2000
Finding EdgeDisjoint Paths in Partial kTrees.
Algorithmica, 2000
A Linear Algorithm for Finding [{g, f}]Colorings of Partial {k}Trees.
Algorithmica, 2000
Foreword.
Algorithmica, 2000
Finding Independent Spanning Trees in Partial kTrees.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Convex Grid Drwaings of FourConnected Plane Graphs.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Characterization of Optimal Key Set Protocols.
Proceedings of the Theoretical Computer Science, 2000
Labeling Points with Rectangles of Various Shapes.
Proceedings of the Graph Drawing, 8th International Symposium, 2000
Rectangular Drawings of Plane Graphs Without Designated Corners.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000
1999
EdgeColoring and fColoring for Various Classes of Graphs.
J. Graph Algorithms Appl., 1999
A Linear Algorithm for BendOptimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.
J. Graph Algorithms Appl., 1999
Decompositions to DegreeConstrainded Subgraphs Are Simply Reducible to EdgeColorings.
J. Comb. Theory, Ser. B, 1999
A LinearTime Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs.
Int. J. Found. Comput. Sci., 1999
A PolynomialTime Algorithm for Finding Total Colorings of Partial kTrees.
Int. J. Found. Comput. Sci., 1999
A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.
Int. J. Comput. Geometry Appl., 1999
BoxRectangular Drawings of Plane Graphs.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1999
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
A Linear Algorithm for Finding Total Colorings of Partial kTrees.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Grid Drawings of FourConnected Plane Graphs.
Proceedings of the Graph Drawing, 7th International Symposium, 1999
Dealing Necessary and Sufficient Numbers of Cards for Sharing a OneBit Secret Key.
Proceedings of the Advances in Cryptology, 1999
1998
Rectangular grid drawings of plane graphs.
Comput. Geom., 1998
A LinearTime Algorithm to Find Four Independent Spanning Trees in FourConnected Planar Graphs.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1998
A PolynomialTime Algorithm for Finding Total Colorings of Partial kTrees.
Proceedings of the GraphTheoretic Concepts in Computer Science, 1998
The EdgeDisjoint Paths Problem is NPComplete for Partial kTrees.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
Eulerian Secret Key Exchange.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998
1997
An NC Parallel Algorithm for EdgeColoring SeriesParallel Multigraphs.
J. Algorithms, 1997
A LinearTime Algorithm for FourPartitioning FourConnected Planar Graphs.
Inf. Process. Lett., 1997
Shortest NonCrossing Rectilinear Paths in Plane Regions.
Int. J. Comput. Geometry Appl., 1997
An NC Parallel Algorithm for Generalized VertexRankings of Partial kTrees.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997
An Algorithm for Finding a Region with the Minimum Lotal L_{1} from Prescribed Terminals.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997
Generalized VertexRankings of Partial ktrees.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997
1996
A Linear Algorithm for EdgeColoring SeriesParallel Multigraphs.
J. Algorithms, 1996
EdgeColoring Partial kTrees.
J. Algorithms, 1996
Shortest Noncrossing Paths in Plane Graphs.
Algorithmica, 1996
Generalized EdgeRanking of Trees (Extended Abstract).
Proceedings of the GraphTheoretic Concepts in Computer Science, 1996
Finding EdgeDisjoint Paths in Partial kTrees (Extended Abstract).
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
A LinearTime Algorithm for FourPartitioning FourConnected Planar Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996
Rectangular Grid Drawings of Plane Graphs.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
Generalized VertexRankings of Trees.
Inf. Process. Lett., 1995
Finding Optimal EdgeRankings of Trees.
Proceedings of the Sixth Annual ACMSIAM Symposium on Discrete Algorithms, 1995
Algorithms for Finding fColorings of Partial kTrees.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
Simple Reduction of fColorings to EdgeColorings.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
EdgeColoring Algorithms.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995
1994
Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming.
Int. J. Comput. Geometry Appl., 1994
kConnectivity and Decomposition of Graphs into Forests.
Discrete Applied Mathematics, 1994
A Parallel Algorithm for EdgeColoring Partial kTrees.
Proceedings of the Algorithm Theory, 1994
Optimal parallel algorithm for edgecoloring partial ktrees with bounded degrees.
Proceedings of the International Symposium on Parallel Architectures, 1994
EdgeColoring and fColoring for Various Classes of Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
An Efficient Algorithm for EdgeRanking Trees.
Proceedings of the Algorithms, 1994
1993
Multiple Assignment Scheme for Sharing Secret.
J. Cryptology, 1993
Scheduling File Transfers Under Port and Channe; Constraints.
Int. J. Found. Comput. Sci., 1993
Finding Shortest NonCrossing Rectilinear Paths in Plane Regions.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
Sequential and parallel algorithms for edgecoloring seriesparallel multigraphs.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
Nearly uniform scheduling of file transfers.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
A Linear Algorithm for EdgeColoring Partial kTrees.
Proceedings of the Algorithms  ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993
1992
VariablePriority Queue and Doughnut Routing.
J. Algorithms, 1992
Algorithms for Routing around a Rectangle.
Discrete Applied Mathematics, 1992
An Efficient Algorithm for EdgeColoring SeriesParallel Multigraphs.
Proceedings of the LATIN '92, 1992
Algorithms for Finding NonCrossing Paths with Minimum Total Length in Plane Graphs.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1991
Scheduling File Transfers under Port and Channel Constraints.
Proceedings of the ISA '91 Algorithms, 1991
1990
On the 1.1 EdgeColoring of Multigraphs.
SIAM J. Discrete Math., 1990
Improved EdgeColoring Algorithms for Planar Graphs.
J. Algorithms, 1990
A Linear Algorithm for Bipartition of Biconnected Graphs.
Inf. Process. Lett., 1990
Edgedisjoint paths in a grid bounded by two nested rectangles.
Discrete Applied Mathematics, 1990
On the fgcoloring of graphs.
Combinatorica, 1990
Finding Steiner Forests in Planar Graphs.
Proceedings of the First Annual ACMSIAM Symposium on Discrete Algorithms, 1990
Parallel Algorithms for Finding Steiner Forests in Planar Graphs.
Proceedings of the Algorithms, 1990
1989
The Hamiltonian Cycle Problem is LinearTime Solvable for 4Connected Planar Graphs.
J. Algorithms, 1989
Algorithms for Multicommodity Flows in Planar Graphs.
Algorithmica, 1989
1986
Planar Multicommodity Flows, Maximum Matchings and Negative Cycles.
SIAM J. Comput., 1986
A Better than "Best Possible" Algorithm to Edge Color Multigraphs.
J. Algorithms, 1986
1985
A LinearTime Routing Algorithm for Convex Grids.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1985
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks.
SIAM J. Comput., 1985
Arboricity and Subgraph Listing Algorithms.
SIAM J. Comput., 1985
A Linear Algorithm for Embedding Planar Graphs Using PQTrees.
J. Comput. Syst. Sci., 1985
Lower Bounds for Combinatorial Problems on Graphs.
J. Algorithms, 1985
Drawing Plane Graphs Nicely.
Acta Inf., 1985
Multicommodity Flows in Planar Undirected Graphs and Shortest Paths
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
1984
A note on nongraphic matroids.
J. Comb. Theory, Ser. B, 1984
A Note on the Critical Problem for Matroids.
Eur. J. Comb., 1984
1983
An algorithm for finding a large independent set in planar graphs.
Networks, 1983
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs.
Discrete Applied Mathematics, 1983
1982
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs.
SIAM J. Comput., 1982
Lineartime computability of combinatorial problems on seriesparallel graphs.
J. ACM, 1982
1981
A Linear 5Coloring Algorithm of Planar Graphs.
J. Algorithms, 1981
On the maximum matchings of regular multigraphs.
Discrete Mathematics, 1981
Combinatorial problems on seriesparallel graphs.
Discrete Applied Mathematics, 1981
1980
An algorithm for finding a short closed spanning walk in a graph.
Networks, 1980
An upper bound on the length of a Hamiltonian walk of a maximal planar graph.
Journal of Graph Theory, 1980
A 1tough nonhamiltonian maximal planar graph.
Discrete Mathematics, 1980
Combinatorial problems on seriesparallel graphs.
Proceedings of the Graph Theory and Algorithms, 1980
A linear algorithm for fivecoloring a planar graph.
Proceedings of the Graph Theory and Algorithms, 1980
1979
Lower bounds on the cardinality of the maximum matchings of planar graphs.
Discrete Mathematics, 1979
On the relationship between the genus and the cardinality of the maximum matchings of a graph.
Discrete Mathematics, 1979
1978
Necessary and sufficient conditions for a graph to be threeterminal seriesparallelcascade.
J. Comb. Theory, Ser. B, 1978