Naomi Nishimura

Professor

Research Interests

Professor Nishimura's research is in the area of algorithms and complexity, with an emphasis on graph algorithms.  Her main research interests involve the identification and use of structure in developing algorithms, such as graph algorithms, fixed-parameter algorithms, and algorithms for reconfiguration problems.

Parameterized complexity allows the development of efficient algorithms for various problems which, when considered in full generality, are considered to be intractable. The aim of the parameterized approach is to identify the source of complexity as one or more parameters of the problem, obtaining algorithms that are polynomial in the size of the input but possibly exponential in the parameter(s). In situations in which the parameters are guaranteed to be small in comparison to the size of the input, these techniques yield polynomial-time algorithms. Professor Nishimura's work includes the first parameterized algorithms for graph drawing problems and for backdoor sets for formulas for the satisfiability problem.

Reconfiguration considers the solution space of an instance of a problem, asking, for example, whether it is possible to transform one feasible solution into another in a sequence of reconfiguration steps such that each step results in a feasible solution.  Professor Nishimura and her collaborators were the first to consider the parameterized complexity of reconfiguration problems, and continue to explore the two areas both singly and in combination.  This work applies to a large range of problem domains, and is part of a long-term project to study algorithms for situations subject to change.

Degrees and Awards

BS (Yale), MSc, PhD (Toronto)

Representative Publications

A. Mouawad, N. Nishimura, V. Raman, and M. Wrochna. Reconfiguration over tree decompositions. Proceedings of the 9th International Symposium on Parameterized and Exact Computation, 2014.

A. Mouawad, N. Nishimura, V. Raman, N. Simjour, and A. Suzuki. On the parameterized complexity of reconfiguration problems. Proceedings of the 8th International Symposium on Parameterized and Exact Computation, pp. 281-294, 2013.

M. Kaminski and N. Nishimura. Finding an induced path of given parity in planar graphs in polynomial time. Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 656-670, 2012.

V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosemand, M. Suderman, S. Whitesides, and D. R. Wood. On the parameterized complexity of layered graph drawing. Algorithmica, 52(2):267-292, 2008.

N. Nishimura, P. Ragde, and S. Szeider. Solving #SAT using vertex covers. Acta Informatica, 44(7-8):509-523, 2007.

Affiliation:
University of Waterloo
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8573477864265442, "perplexity": 1661.8438941629308}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-26/segments/1560627998100.52/warc/CC-MAIN-20190616102719-20190616124719-00085.warc.gz"}