Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
ITO, Takehiro
21  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
1

Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Saito, Rin ; Eto, Hiroshi ; Ito, Takehiro. - p. 191-201 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Reconfiguration of Time-Respecting Arborescences:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Ito, Takehiro ; Iwamasa, Yuni ; Kamiyama, Naoyuki... - p. 521-532 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Algorithmic Theory of Qubit Routing:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Ito, Takehiro ; Kakimura, Naonori ; Kamiyama, Naoyuki.. - p. 533-546 , 2023
Link: https://doi.org/10.1007/..
 
?
4

ZDD-Based Algorithmic Framework for Solving Shortest Reconf..:

, In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research; Lecture Notes in Computer Science,
Ito, Takehiro ; Kawahara, Jun ; Nakahata, Yu... - p. 167-183 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Solving Reconfiguration Problems of First-Order Expressible..:

, In: 2023 IEEE 35th International Conference on Tools with Artificial Intelligence (ICTAI),
Toda, Takahisa ; Ito, Takehiro ; Kawahara, Jun... - p. 294-302 , 2023
Link: https://doi.org/10.1109/..
 
?
6

Reconfiguration of Regular Induced Subgraphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Eto, Hiroshi ; Ito, Takehiro ; Kobayashi, Yasuaki.. - p. 35-46 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Happy Set Problem on Subclasses of Co-comparability Graphs:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Eto, Hiroshi ; Ito, Takehiro ; Miyano, Eiji.. - p. 149-160 , 2022
Link: https://doi.org/10.1007/..
 
?
8

On Reachable Assignments Under Dichotomous Preferences:

, In: PRIMA 2022: Principles and Practice of Multi-Agent Systems; Lecture Notes in Computer Science,
Ito, Takehiro ; Kakimura, Naonori ; Kamiyama, Naoyuki... - p. 650-658 , 2022
Link: https://doi.org/10.1007/..
 
?
9

Invitation to Combinatorial Reconfiguration:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Ito, Takehiro - p. 26-31 , 2022
Link: https://doi.org/10.1007/..
 
?
10

Reconfiguring Directed Trees in a Digraph:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Ito, Takehiro ; Iwamasa, Yuni ; Kobayashi, Yasuaki... - p. 343-354 , 2021
Link: https://doi.org/10.1007/..
 
?
11

Approximability of the Independent Feedback Vertex Set Prob..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Tamura, Yuma ; Ito, Takehiro ; Zhou, Xiao - p. 286-295 , 2020
Link: https://doi.org/10.1007/..
 
?
12

Incremental Optimization of Independent Sets Under the Reco..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Ito, Takehiro ; Mizuta, Haruka ; Nishimura, Naomi. - p. 313-324 , 2019
Link: https://doi.org/10.1007/..
 
?
13

Diameter of Colorings Under Kempe Changes:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Bonamy, Marthe ; Heinrich, Marc ; Ito, Takehiro... - p. 52-64 , 2019
Link: https://doi.org/10.1007/..
 
?
14

Shortest Reconfiguration of Matchings:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Bousquet, Nicolas ; Hatanaka, Tatsuhiko ; Ito, Takehiro. - p. 162-174 , 2019
Link: https://doi.org/10.1007/..
 
?
15

Algorithms for Gerrymandering over Graphs:

, In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems,
Ito, Takehiro ; Kamiyama, Naoyuki ; Kobayashi, Yusuke. - p. 1413-1421 , 2019
Link: https://dl.acm.org/doi/1..
 
1-15