Takao Nishizeki
Affiliations:- Tohoku University, Japan
According to our database1,
Takao Nishizeki
authored at least 172 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 Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2016
2015
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs.
Theor. Comput. Sci., 2015
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015
2014
Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract).
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
2013
Rectangular Drawing Algorithms.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
2012
Discret. Math. Algorithms Appl., 2012
Algorithmica, 2012
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012
2011
Theor. Comput. Sci., 2011
IEICE Trans. Inf. Syst., 2011
2010
Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions.
J. Multiple Valued Log. Soft Comput., 2010
Discret. Math. Algorithms Appl., 2010
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010
2009
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
Discret. Comput. Geom., 2009
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009
Convex Drawings of Internally Triconnected Plane Graphs on <i>O</i>(<i>n</i><sup>2</sup>) Grids.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009
2008
SIAM J. Discret. Math., 2008
Theory Comput. Syst., 2008
J. Graph Algorithms Appl., 2008
J. Discrete Algorithms, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
2007
J. Discrete Algorithms, 2007
Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
IEICE Trans. Inf. Syst., 2007
Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007
2006
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.
J. Discrete Algorithms, 2006
Int. J. Found. Comput. Sci., 2006
Int. J. Found. Comput. Sci., 2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
IEICE Trans. Inf. Syst., 2006
2005
Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs.
Int. J. Found. Comput. Sci., 2005
IEICE Trans. Inf. Syst., 2005
Proceedings of the Web Information Systems Engineering, 2005
Proceedings of the Graph Drawing, 13th International Symposium, 2005
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005
2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004
Lecture Notes Series on Computing 12, World Scientific, ISBN: 981-256-033-5, 2004
2003
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
Proceedings of the Graph Drawing, 11th International Symposium, 2003
2002
Int. J. Inf. Sec., 2002
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
Proceedings of the Graph Drawing, 10th International Symposium, 2002
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002
2001
J. Comb. Optim., 2001
Discret. Appl. Math., 2001
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
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
Theor. Comput. Sci., 2000
A Linear Algorithm for Finding [{<i>g</i>, <i>f</i>}]-Colorings of Partial {<i>k</i>}-Trees.
Algorithmica, 2000
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Proceedings of the Graph Drawing, 8th International Symposium, 2000
1999
J. Graph Algorithms Appl., 1999
A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.
J. Graph Algorithms Appl., 1999
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.
J. Comb. Theory B, 1999
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs.
Int. J. Found. Comput. Sci., 1999
Int. J. Found. Comput. Sci., 1999
Int. J. Comput. Geom. Appl., 1999
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Proceedings of the Graph Drawing, 7th International Symposium, 1999
Proceedings of the Advances in Cryptology, 1999
1998
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998
1997
J. Algorithms, 1997
Inf. Process. Lett., 1997
Int. J. Comput. Geom. Appl., 1997
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997
An Algorithm for Finding a Region with the Minimum Lotal L<sub>1</sub> 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
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997
1996
J. Algorithms, 1996
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
1995
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
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. Geom. Appl., 1994
Proceedings of the Algorithm Theory, 1994
Proceedings of the International Symposium on Parallel Architectures, 1994
1993
Int. J. Found. Comput. Sci., 1993
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
Sequential and parallel algorithms for edge-coloring series-parallel 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
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993
1992
Proceedings of the LATIN '92, 1992
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
1991
Proceedings of the ISA '91 Algorithms, 1991
1990
Discret. Appl. Math., 1990
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990
Proceedings of the Algorithms, 1990
1989
J. Algorithms, 1989
1986
SIAM J. Comput., 1986
J. Algorithms, 1986
1985
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1985
SIAM J. Comput., 1985
J. Comput. Syst. Sci., 1985
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
1984
1983
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs.
Discret. Appl. Math., 1983
1982
SIAM J. Comput., 1982
J. ACM, 1982
1981
1980
J. Graph Theory, 1980
Proceedings of the Graph Theory and Algorithms, 1980
1979
Discret. Math., 1979
On the relationship between the genus and the cardinality of the maximum matchings of a graph.
Discret. Math., 1979
1978
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade.
J. Comb. Theory B, 1978