Kei Kimura

Orcid: 0000-0002-0560-5127

According to our database1, Kei Kimura authored at least 27 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Tighter Adaptive IBEs and VRFs: Revisiting Waters' Artificial Abort.
IACR Cryptol. ePrint Arch., 2024

Weighted Envy-free Allocation with Subsidy.
CoRR, 2024

Solving a Stackelberg Game on Transportation Networks in a Dynamic Crime Scenario: A Mixed Approach on Multi-Layer Networks.
CoRR, 2024

Online L<sup>♮</sup>-Convex Minimization.
CoRR, 2024

Characterizing the integer points in 2-decomposable polyhedra by closedness under operations.
CoRR, 2024

Parameterized Complexity of Weighted Target Set Selection.
Proceedings of the Theory and Applications of Models of Computation, 2024

Online $\textrm{L}^{\natural }$-Convex Minimization.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2024

Analyzing Incentives and Fairness in Ordered Weighted Average for Facility Location Games.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Fairness and Efficiency Trade-off in Two-sided Matching.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Multi-Stage Generalized Deferred Acceptance Mechanism: Strategyproof Mechanism for Handling General Hereditary Constraints.
CoRR, 2023

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

Algorithms for Coloring Reconfiguration Under Recolorability Digraphs.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
Trichotomy for the reconfiguration problem of integer linear systems.
Theor. Comput. Sci., 2021

Quantaloidal approach to constraint satisfaction.
Proceedings of the Fourth International Conference on Applied Category Theory, 2021

Optimal Matroid Partitioning Problems.
Algorithmica, 2021

2020
Stronger Hardness Results on the Computational Complexity of Picross 3D.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

2019
Approximating Partially Bounded Degree Deletion on Directed Graphs.
J. Graph Algorithms Appl., 2019

NP-Completeness of Fill-a-Pix and Σ<i><sup>P</sup></i><sub>2</sub>-Completeness of Its Fewest Clues Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018
Maximum lifetime coverage problem with battery recovery effect.
Sustain. Comput. Informatics Syst., 2018

Linear Satisfiability Preserving Assignments.
J. Artif. Intell. Res., 2018

Linear Satisfiability Preserving Assignments (Extended Abstract).
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

The Fewest Clues Problem of Picross 3D.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2016
Trichotomy for integer linear systems based on their sign patterns.
Discret. Appl. Math., 2016

2014
Maximum lifetime coverage problems with battery recovery effects.
Proceedings of the IEEE Global Communications Conference, 2014

2007
A Monolithic Approach and a Type-by-Type Approach for Non-Factoid Question-answering - Yokohama National University at NTCIR-6 QAC.
Proceedings of the 6th NTCIR Workshop Meeting on Evaluation of Information Access Technologies: Information Retrieval, 2007


  Loading...