Yoichi Iwata

According to our database1, Yoichi Iwata authored at least 24 papers between 2011 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set.
Algorithmica, 2021

2019
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Separator-Based Pruned Dynamic Programming for Steiner Tree.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Parameterized Algorithms to Compute Ising Partition Function.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing.
CoRR, 2017

Linear-Time Kernelization for Feedback Vertex Set.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover.
Theor. Comput. Sci., 2016

Half-integrality, LP-branching, and FPT Algorithms.
SIAM J. Comput., 2016

Cut Tree Construction from Massive Graphs.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015
An Exact Algorithm for Diameters of Large Real Directed Graphs.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

On the Equivalence among Problems of Bounded Width.
Proceedings of the Algorithms - ESA 2015, 2015

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Computing Personalized PageRank Quickly by Exploiting Graph Structures.
Proc. VLDB Endow., 2014

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling.
Proceedings of the 23rd International World Wide Web Conference, 2014

Fast Dynamic Graph Algorithms for Parameterized Problems.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Linear-Time FPT Algorithms via Network Flow.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Fast exact shortest-path distance queries on large networks by pruned landmark labeling.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2011
A Faster Algorithm for Dominating Set Analyzed by the Potential Method.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011


  Loading...