Yuichi Asahiro

According to our database1, Yuichi Asahiro authored at least 56 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144].
Theor. Comput. Sci., October, 2023

Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots.
CoRR, 2023

Compatibility of convergence algorithms for autonomous mobile robots.
CoRR, 2023

Minimum Algorithm Sizes for Self-stabilizing Gathering and Related Problems of Autonomous Mobile Robots (Extended Abstract).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2023

Approximation Algorithms for the Longest Run Subsequence Problem.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Shortest Longest-Path Graph Orientations.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Independent Set Under a Change Constraint from an Initial Solution.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022
Monotonic self-stabilization and its application to robust and adaptive pattern formation.
Theor. Comput. Sci., 2022

Upper and lower degree-constrained graph orientation with minimum penalty.
Theor. Comput. Sci., 2022

Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Complexity and approximability of the happy set problem.
Theor. Comput. Sci., 2021

Graph Orientation with Edge Modifications.
Int. J. Found. Comput. Sci., 2021

How to pack directed acyclic graphs into small blocks.
Discret. Appl. Math., 2021

Parameterized algorithms for the Happy Set problem.
Discret. Appl. Math., 2021

2020
Graph orientation with splits.
Theor. Comput. Sci., 2020

Exact algorithms for the repetition-bounded longest common subsequence problem.
Theor. Comput. Sci., 2020

Graph Classes and Approximability of the Happy Set Problem.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems.
Rev. Socionetwork Strateg., 2019

An Approximation Algorithm for the Maximum Induced Matching Problem on <i>C</i><sub>5</sub>-Free Regular Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Graph Orientation with Edge Modifications.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.
Algorithmica, 2018

Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks.
Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2016
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation.
Theory Comput. Syst., 2016

Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.
Proceedings of the 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 17th International Symposium on Advanced Intelligent Systems (ISIS), 2016

2015
Graph Orientations Optimizing the Number of Light or Heavy Vertices.
J. Graph Algorithms Appl., 2015

An Improvement of the Greedy Algorithm for the (n^2-1) -Puzzle.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Complexity of finding maximum regular induced subgraphs with prescribed degree.
Theor. Comput. Sci., 2014

2013
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation.
J. Comb. Optim., 2013

Inapproximability of Maximum <i>r</i>-Regular Induced Connected Subgraph Problems.
IEICE Trans. Inf. Syst., 2013

Optimal approximability of bookmark assignments.
Discret. Appl. Math., 2013

2012
NP-hardness of the sorting buffer problem on the uniform metric.
Discret. Appl. Math., 2012

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree.
J. Comb. Optim., 2011

Graph Orientation to Maximize the Minimum Weighted Outdegree.
Int. J. Found. Comput. Sci., 2011

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree.
Discret. Appl. Math., 2011

2010
Weighted nearest neighbor algorithms for the graph exploration problem on cycles.
Inf. Process. Lett., 2010

Approximating Maximum Diameter-Bounded Subgraphs.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2008
Grasp and Delivery for Moving Objects on Broken Lines.
Theory Comput. Syst., 2008

A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007
Graph Orientation Algorithms to minimize the Maximum Outdegree.
Int. J. Found. Comput. Sci., 2007

On Approximation of Bookmark Assignments.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
How to Pack Directed Acyclic Graphs into Small Blocks.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
Pickup and Delivery for Moving Objects on Broken Lines.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
How to Collect Balls Moving in the Euclidean Plane.
Proceedings of Computing: The Australasian Theory Symposium, 2004

2003
Independentand cooperative parallel search methods for the generalized assignment problem.
Optim. Methods Softw., 2003

2002
Complexity of finding dense subgraphs.
Discret. Appl. Math., 2002

Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order.
Proceedings of the 2002 International Symposium on Information Technology (ITCC 2002), 2002

2001
A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000
Greedily Finding a Dense Subgraph.
J. Algorithms, 2000

Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder.
Proceedings of the Distributed Autonomous Robotic Systems 4, 2000

1998
Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time.
Proceedings of the Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28, 1998

1995
Finding Dense Subgraphs.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1993
Random generation of test instances with controlled attributes.
Proceedings of the Cliques, 1993


  Loading...