Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Kei Kimura and Kazuhisa Makino. A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 47:1-47:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{kimura_et_al:LIPIcs.ISAAC.2023.47, author = {Kimura, Kei and Makino, Kazuhisa}, title = {{A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {47:1--47:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.47}, URN = {urn:nbn:de:0030-drops-193492}, doi = {10.4230/LIPIcs.ISAAC.2023.47}, annote = {Keywords: linear programming problem, certifying algorithm, Horn system} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki. Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fujii_et_al:LIPIcs.ISAAC.2022.4, author = {Fujii, Soichiro and Iwamasa, Yuni and Kimura, Kei and Suzuki, Akira}, title = {{Algorithms for Coloring Reconfiguration Under Recolorability Digraphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {4:1--4:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.4}, URN = {urn:nbn:de:0030-drops-172896}, doi = {10.4230/LIPIcs.ISAAC.2022.4}, annote = {Keywords: combinatorial reconfiguration, graph coloring, recolorability, recoloring} }
Published in: LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)
Kei Kimura, Takuya Kamehashi, and Toshihiro Fujito. The Fewest Clues Problem of Picross 3D. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 25:1-25:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kimura_et_al:LIPIcs.FUN.2018.25, author = {Kimura, Kei and Kamehashi, Takuya and Fujito, Toshihiro}, title = {{The Fewest Clues Problem of Picross 3D}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {25:1--25:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.25}, URN = {urn:nbn:de:0030-drops-88168}, doi = {10.4230/LIPIcs.FUN.2018.25}, annote = {Keywords: Puzzle, computational complexity, fewest clues problem} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, and Hanna Sumita. Optimal Matroid Partitioning Problems. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 51:1-51:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{kawase_et_al:LIPIcs.ISAAC.2017.51, author = {Kawase, Yasushi and Kimura, Kei and Makino, Kazuhisa and Sumita, Hanna}, title = {{Optimal Matroid Partitioning Problems}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {51:1--51:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.51}, URN = {urn:nbn:de:0030-drops-82712}, doi = {10.4230/LIPIcs.ISAAC.2017.51}, annote = {Keywords: Matroids, Partitioning problem, PTAS, NP-hardness} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Kei Kimura and Kazuhisa Makino. Trichotomy for Integer Linear Systems Based on Their Sign Patterns. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 613-623, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{kimura_et_al:LIPIcs.STACS.2012.613, author = {Kimura, Kei and Makino, Kazuhisa}, title = {{Trichotomy for Integer Linear Systems Based on Their Sign Patterns}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {613--623}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.613}, URN = {urn:nbn:de:0030-drops-34367}, doi = {10.4230/LIPIcs.STACS.2012.613}, annote = {Keywords: Integer linear system, Sign pattern, Complexity index, TVPI system, Horn system} }