Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Soh Kumabe. Interval Query Problem on Cube-Free Median Graphs. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kumabe:LIPIcs.ISAAC.2021.18, author = {Kumabe, Soh}, title = {{Interval Query Problem on Cube-Free Median Graphs}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.18}, URN = {urn:nbn:de:0030-drops-154510}, doi = {10.4230/LIPIcs.ISAAC.2021.18}, annote = {Keywords: Data Structures, Range Query Problems, Median Graphs} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Hiroshi Hirai and Ryuhei Mizutani. Minimum 0-Extension Problems on Directed Metrics. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 46:1-46:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hirai_et_al:LIPIcs.MFCS.2020.46, author = {Hirai, Hiroshi and Mizutani, Ryuhei}, title = {{Minimum 0-Extension Problems on Directed Metrics}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.46}, URN = {urn:nbn:de:0030-drops-127120}, doi = {10.4230/LIPIcs.MFCS.2020.46}, annote = {Keywords: Minimum 0-extension problems, Directed metrics, Valued constraint satisfaction problems, Computational complexity} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Hiroshi Hirai and Motoki Ikeda. Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 65:1-65:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hirai_et_al:LIPIcs.ICALP.2020.65, author = {Hirai, Hiroshi and Ikeda, Motoki}, title = {{Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {65:1--65:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.65}, URN = {urn:nbn:de:0030-drops-124725}, doi = {10.4230/LIPIcs.ICALP.2020.65}, annote = {Keywords: terminal backup problem, node-connectivity, separately-capacitated multiflow, discrete convex analysis} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Taihei Oki. On Solving (Non)commutative Weighted Edmonds' Problem. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 89:1-89:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{oki:LIPIcs.ICALP.2020.89, author = {Oki, Taihei}, title = {{On Solving (Non)commutative Weighted Edmonds' Problem}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {89:1--89:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.89}, URN = {urn:nbn:de:0030-drops-124963}, doi = {10.4230/LIPIcs.ICALP.2020.89}, annote = {Keywords: skew fields, Edmonds' problem, Dieudonn\'{e} determinant, degree computation, Smith - McMillan form, matrix expansion, discrete Legendre conjugacy} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Hiroshi Hirai and Yuni Iwamasa. Reconstructing Phylogenetic Tree From Multipartite Quartet System. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 57:1-57:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hirai_et_al:LIPIcs.ISAAC.2018.57, author = {Hirai, Hiroshi and Iwamasa, Yuni}, title = {{Reconstructing Phylogenetic Tree From Multipartite Quartet System}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {57:1--57:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.57}, URN = {urn:nbn:de:0030-drops-100056}, doi = {10.4230/LIPIcs.ISAAC.2018.57}, annote = {Keywords: phylogenetic tree, quartet system, reconstruction} }
Published in: LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, and Stanislav Zivny. Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 39:1-39:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hirai_et_al:LIPIcs.STACS.2018.39, author = {Hirai, Hiroshi and Iwamasa, Yuni and Murota, Kazuo and Zivny, Stanislav}, title = {{Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-062-0}, ISSN = {1868-8969}, year = {2018}, volume = {96}, editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.39}, URN = {urn:nbn:de:0030-drops-85042}, doi = {10.4230/LIPIcs.STACS.2018.39}, annote = {Keywords: valued constraint satisfaction problems, discrete convex analysis, M-convexity} }
Feedback for Dagstuhl Publishing