researchmap

researchmap

researchmap

Publishing type：Research paper (scientific journal)   Publisher：Informa UK Limited  

Participation in global value chains (GVCs) can help countries achieve productivity growth and increase the domestic value added (DVA) through the allocation of production processes. Therefore, identifying the factors within the GVC (value added productivity, export share, backward and forward linkage of them, and economic scale) that help countries reveals key considerations in economic policy-making for DVA production contribution. We developed a new structural decomposition analysis that decomposes time-series changes of export-related DVA into five effects and empirically analysed Japan’s economy between 2000–2014. The results show that the domestic supply chain and share of intermediate export goods negatively impacted Japan’s DVA. We found that Japan’s exports triggered expansion in the downstream markets of emerging nations, like China, and high-technology industries are key to GVC growth.

DOI： 10.1080/17421772.2024.2385094

Web of Science

Scopus

researchmap

Publishing type：Research paper (scientific journal)   Publisher：Springer  

Abstract

Although durable goods with low energy consumption are being promoted to achieve a decarbonised society, from the perspective of life-cycle assessment, the choice of new durable goods may increase CO₂ emissions. To address this problem, research has been conducted on product replacement based on life-cycle optimisation (LCO), a method for identifying a replacement life span that minimises life-cycle CO₂ emissions. However, several additional assumptions complicate the analysis of replacement patterns of products and conditional formulas because cumulative emissions do not increase linearly when considering energy mix and technology improvement, and it is difficult to extend the model to optimisation methods in previous LCO studies. This study developed a new LCO approach by applying the shortest path problem to graph theory. Our methodology can contribute to the following: (i) it is computationally inexpensive; (ii) it is intuitively easy to add complex conditions, such as various policy scenarios and parameter changes; and (iii) once the graph of replacement patterns is defined, the optimal solution can be derived using existing solution methods, such as the Dijkstra algorithm. As a case study, we focused on vehicle replacement, which is a major source of CO₂ emissions and is being electrified. In particular, we identified vehicle switching paths that minimise life-cycle CO₂ emissions by considering changes in Japan’s energy mix and alternative fuel vehicle (AFV) characteristics. We determined that the optimal vehicle replacement path method to reduce CO₂ emissions is to switch first to plug-in hybrid electric vehicles (PHEVs) and then to battery electric vehicles (BEVs). Thus, we suggest that the transition to electric vehicles requires a step-by-step process. This methodology is not only conducive to AFV deployment for decarbonisation but can also be applied to other products, such as air conditioners and lighting. Thus, various transition policies could be formulated using our methodology.

DOI： 10.1088/2515-7620/ad4513

Web of Science

Scopus

researchmap

Other Link： https://iopscience.iop.org/article/10.1088/2515-7620/ad4513/pdf

Language：English   Publishing type：Research paper (international conference proceedings)  

Publishing type：Research paper (scientific journal)   Publisher：Theoretical Computer Science  

A dominating set S of graph G is called an r-grouped dominating set if S can be partitioned into S1,S2,…,Sk such that the size of each unit Si is r and the subgraph of G induced by Si is connected. The concept of r-grouped dominating sets generalizes several well-studied variants of dominating sets with requirements for connected component sizes, such as the ordinary dominating sets (r=1), paired dominating sets (r=2), and connected dominating sets (r is arbitrary and k=1). In this paper, we investigate the computational complexity of r-GROUPED DOMINATING SET, which is the problem of deciding whether a given graph has an r-grouped dominating set with at most k units. For general r, r-GROUPED DOMINATING SET is hard to solve in various senses because the hardness of the connected dominating set is inherited. We thus focus on the case in which r is a constant or a parameter, but we see that r-GROUPED DOMINATING SET for every fixed r>0 is still hard to solve. From the observations about the hardness, we consider the parameterized complexity concerning well-studied graph structural parameters. We first see that r-GROUPED DOMINATING SET is fixed-parameter tractable for r and treewidth, which is derived from the fact that the condition of r-grouped domination for a constant r can be represented as monadic second-order logic (MSO2). This fixed-parameter tractability is good news, but the running time is not practical. We then design an O⁎(min⁡{(2τ(r+1))τ,(2τ)2τ})-time algorithm for general r≥2, where τ is the twin cover number, which is a parameter between vertex cover number and clique-width. For paired dominating set and trio dominating set, i.e., r∈{2,3}, we can speed up the algorithm, whose running time becomes O⁎((r+1)τ). We further argue the relationship between FPT results and graph parameters, which draws the parameterized complexity landscape of r-GROUPED DOMINATING SET.

DOI： 10.1016/j.tcs.2024.114507

Web of Science

Scopus

researchmap

Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Environmental Research Letters  

Prompted by policy support, battery electric vehicles (BEVs) have become increasingly popular in many countries and economies. To ensure that vehicle electrification contributes to reduction in emissions, governments should develop appropriate transition plans that consider the lifecycle CO2 emissions of these vehicles. In this study, we aimed to establish an emission reduction-focused transition trajectory for vehicle electrification using lifecycle optimisation. Through a Japan-centric case study spanning from 2005 to 2055, we identified an optimal fuel-type progression for car owners, underlining the potential for BEVs to be introduced in the 2030s, a decade ahead of the baseline, if higher emission reduction can be attained. Policymakers are advised to facilitate a gradual shift toward hybrid electric vehicles and plug-in hybrid electric vehicles that initially outperform BEVs in emissions, until a robust level of lifecycle CO2 reduction is achieved within the automotive sector. This study contributes to the discourse by offering a strategic roadmap for maximising emission reduction through targeted vehicle electrification, making it pertinent and informative for both policymakers and stakeholders. The insights underscore the critical role of deliberate policy interventions in orchestrating a sustainable and effective transition toward a lower-emission transportation paradigm.

DOI： 10.1088/1748-9326/ad3b25

Web of Science

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>In this paper, we study BALL COLLECTING WITH LIMITED ENERGY, which is a problem of scheduling robots with limited energy confined to a line to catch moving balls that eventually cross the line. For this problem, we show the NP-completeness of the general case and some algorithmic results for some cases with a small number of robots.</p>

DOI： 10.1587/transinf.2023fcl0003

Web of Science

Scopus

CiNii Research

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>In this letter, we present a new lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. Our bound slightly improves the lower bound given by Chandran and Subramanian [Inf. Process. Lett., 87 (2003)].</p>

DOI： 10.1587/transinf.2023fcl0002

Web of Science

Scopus

CiNii Research

researchmap

Language：Others   Publishing type：Research paper (other academic)   Publisher：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  

The graph parameter vertex integrity measures how vulnerable a graph is to a removal of a small number of vertices. More precisely, a graph with small vertex integrity admits a small number of vertex removals to make the remaining connected components small. In this paper, we initiate a systematic study of structural parameterizations of the problem of computing the unweighted/weighted vertex integrity. As structural graph parameters, we consider well-known parameters such as clique-width, treewidth, pathwidth, treedepth, modular-width, neighborhood diversity, twin cover number, and cluster vertex deletion number. We show several positive and negative results and present sharp complexity contrasts.

DOI： 10.1007/978-981-97-0566-5_29

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/walcom/walcom2024.html#GimaHKM0O24

Language：Others   Publishing type：Research paper (other academic)   Publisher：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  

The problem of packing as many subgraphs isomorphic to as possible in a graph for a class of graphs is well studied in the literature. Both vertex-disjoint and edge-disjoint versions are known to be NP-complete for H that contains at least three vertices and at least three edges, respectively. In this paper, we consider “list variants” of these problems: Given a graph G, an integer k, and a collection of subgraphs of G isomorphic to some , the goal is to compute k subgraphs in that are pairwise vertex- or edge-disjoint. We show several positive and negative results, focusing on classes of sparse graphs, such as bounded-degree graphs, planar graphs, and bounded-treewidth graphs.

DOI： 10.1007/978-981-97-0566-5_30

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/walcom/walcom2024.html#GimaHKOSST024

Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Algorithmica  

Cram, Domineering, and Arc Kayles are well-studied combinatorial games. They are interpreted as edge-selecting-type games on graphs, and the selected edges during a game form a matching. In this paper, we define a generalized game called Colored Arc Kayles, which includes these games. Colored Arc Kayles is played on a graph whose edges are colored in black, white, or gray, and black (resp., white) edges can be selected only by the black (resp., white) player, while gray edges can be selected by both black and white players. We first observe that the winner determination for Colored Arc Kayles can be done in O∗(2n) time by a simple algorithm, where n is the order of the input graph. We then focus on the vertex cover number, which is linearly related to the number of turns, and show that Colored Arc Kayles, BW-Arc Kayles, and Arc Kayles are solved in time O∗(1.4143τ2+3.17τ), O∗(1.3161τ2+4τ), and O∗(1.1893τ2+6.34τ), respectively, where τ is the vertex cover number. Furthermore, we present an O∗((n/ν+1)ν)-time algorithm for Arc Kayles, where ν is neighborhood diversity. We finally show that Arc Kayles on trees can be solved in O∗(2n/2)(=O(1.4143n)) time, which improves O∗(3n/3)(=O(1.4423n)) by a direct adjustment of the analysis of Bodlaender et al.’s O∗(3n/3)-time algorithm for Node Kayles.

DOI： 10.1007/s00453-023-01136-w

Web of Science

Scopus

researchmap

Publishing type：Research paper (scientific journal)   Publisher：Structural Change and Economic Dynamics  

In this paper, we present new referential statistics for the degree of supply chain exposure to network concentration risk. The study's contribution rests on the development of a metric that indicates network concentration in terms of the frequency of supply chain engagement with the regions of analytical concern, alongside the traditional approach based on volume measurement of value-added concentration. Japan, a country with a high propensity to encounter natural hazards, and China, under mounting geopolitical tension with the United States, are chosen as the target regions for the assessment of network concentration. In addition, the highly asymmetric structure of mutual economic dependency in the US-China relations is identified.

DOI： 10.1016/j.strueco.2023.10.002

Web of Science

Scopus

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2402.10815

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2402.09971

researchmap

Language：Others   Publishing type：Research paper (other academic)   Publisher：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  

\textsc{Arc Kayles} and \textsc{Colored Arc Kayles}, two-player games on a graph, are generalized versions of well-studied combinatorial games Cram and Domineering, respectively. In \textsc{Arc Kayles}, players alternately choose an edge to remove with its adjacent edges, and the player who cannot move is the loser. \textsc{Colored Arc Kayles} is similarly played on a graph with edges colored in black, white, or gray, while the black (resp., white) player can choose only a gray or black (resp., white) edge. For \textsc{Arc Kayles}, the vertex cover number (i.e., the minimum size of a vertex cover) is an essential invariant because it is known that twice the vertex cover number upper bounds the number of turns of \textsc{Arc Kayles}, and for the winner determination of \textsc{(Colored) Arc Kayles}, $2^{O(\vc^2)}n^{O(1)}$-time algorithms are proposed, where $\vc$ is the vertex cover number and $n$ is the number of vertices. In this paper, we first give a polynomial kernel for \textsc{Colored Arc Kayles} parameterized by $\vc$, which leads to a faster $2^{O(\vc \log \vc)}n^{O(1)}$-time algorithm for \textsc{Colored Arc Kayles}. We then focus on \textsc{Arc Kayles} on trees, and propose a $2.2361^{\vc}n^{O(1)}$-time algorithm. Furthermore, we show that the winner determination \textsc{Arc Kayles} on a tree can be solved in $O(1.3831^n)$ time, which improves the best-known running time $O(1.4143^n)$. Finally, we show that \textsc{Colored Arc Kayles} is NP-hard, the first hardness result in the family of the above games.

DOI： 10.1007/978-3-031-52113-3_21

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/sofsem/sofsem2024.html#HanakaKLOY24

Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

Identifying transmission sectors that may not be revealed by existing indicators, such as production-based emission (PBE) and consumption-based emission (CBE) accounting, is significant in emission reduction policies and provides insights into novel opportunities for companies and industries to reduce emissions. This study proposed an intermediate-based emission (IBE) accounting approach that considers indirect emissions from intermediate goods production and a case study was conducted using Exiobase 3.8. The highest IBE sector was ‘basic iron’ (1131 Mt-CO2), and the sector's IBE was higher than its PBE (1052 Mt-CO2). Additionally, the material sector, such as aluminum products (326 Mt-CO2), was identified as a key transmission sector, although PBE (21 Mt-CO2) and CBE (3 Mt-CO2) of the sector is very low. In addition, IBEs were observed to be closely related to overall supply chain emissions in Germany, Japan, and Asia, and cooperation is required to reduce the emissions. The method enables approaching supply chains with large emissions from three perspectives (production-, consumption-, and intermediate-based accounting) and exploration of the emission reduction responsibilities of the three key sectors. The utility and discussion of the approach are consistent with Scope 3 emissions and facilitate fair allocation of emission reduction responsibilities to a larger number of countries and industries.

DOI： 10.1016/j.jclepro.2023.140487

Web of Science

Scopus

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

DOI： 10.2139/ssrn.4675079

researchmap

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/ijnc/ijnc14.html#HanakaOS24

Publisher：Schloss Dagstuhl–Leibniz-Zentrum für Informatik  

Publishing type：Research paper (international conference proceedings)   Publisher：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  

For an undirected and edge-weighted graph G=(V,E) and a vertex subset S⊆V, we define a function φG(formula presented), where (formula presented) is a real number, w(S) is the sum of weights of edges having two endpoints in S, and w(S,V\S) is the sum of weights of edges having one endpoint in S and the other in V\S. Then, given a graph G=(V,E) and a positive integer k, Max (Min) α-Fixed Cardinality Graph Partitioning (Max (Min) α-FCGP) is the problem to find a vertex subset (formula presented) of size k that maximizes (minimizes) φG(S). In this paper, we first show that Max α-FCGP with (formula presented) and Minα-FCGP with (formula presented) can be solved in time (formula presented)-time algorithm on general graphs and a (formula presented)-time randomized algorithm on apex-minor-free graphs. Moreover, for Max α-FCGP with (formula presented) and Min (formula presented), we propose an (1+d)k2o(kd)+O(k)nO(1)-time algorithm. Finally, we show that they admit FPT-ASs when edge weights are constant.

DOI： 10.1007/978-3-031-60924-4_17

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/iscopt/isco2024.html#YamadaH24

Language：English   Publisher：IJNC Editorial Committee  

For an undirected graph G = (V,E) and a k-non-negative integer vector p = (p1, . . . , pk), a mapping l : V → N∪{0} is called an L(p)-labeling of G if |l(u) − l(v)| ≥ pd for any two distinct vertices u, v ∈ V with distance d, and the maximum value of {l(v) | v ∈ V } is called the span of l. Originally, L(p)-labeling of G for p = (2, 1) is introduced in the context of frequency assignment in radio networks, where ‘close’ transmitters must receive different frequencies and ‘very close’ transmitters must receive frequencies that are at least two frequencies apart so that they can avoid interference. L(p)-Labeling is the problem of finding the minimum span λp among L(p)-labelings of G, which is NP-hard for every non-zero p. L(p)-Labeling is well studied for specific p’s; in particular, many (exact or approximation) algorithms for general graphs or restricted classes of graphs are proposed for p = (2, 1) or more generally p = (p, q). Unfortunately, most algorithms strongly depend on the values of p, and it is not apparent to extend algorithms for p to ones for another p′ in general. In this paper, we give a simple polynomial-time reduction of L(p)-Labeling on graphs with a small diameter to Metric (Path) TSP, which enables us to use numerous results on (Metric) TSP. On the practical side, we can utilize various high-performance heuristics for TSP, such as Concordo and LKH, to solve our problem. On the theoretical side, we can see that the problem for any p under this framework is 1.5-approximable, and it can be solved by the Held-Karp algorithm in O(2nn2) time, where n is the number of vertices, and so on.

DOI： 10.15803/ijnc.14.1_26

CiNii Research

Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2409.07848

researchmap

Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2404.08520

researchmap

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-031-49611-0_28

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2312.08639

researchmap

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.4230/LIPIcs.ISAAC.2023.37

Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Theoretical Computer Science  

For a graph G=(V,E) and a subset S⊆V of vertices, a vertex is happy if all its neighbor vertices in G are contained in S. Given a connected undirected graph and an integer k, the Maximum Happy Set Problem (MaxHS) asks to find a set S of k vertices which maximizes the number of happy vertices in S (note that all happy vertices in V belong to S). We proposed an algorithm for MaxHS on proper interval graphs in Theor. Comput. Sci. 866 (2021) 123–144. However, due to a wrong observation made by the authors, it works only on proper interval graphs obeying the observation. In this corrigendum, we propose a new algorithm which runs in O(k|V|log⁡k+|E|) time for proper interval graphs.

DOI： 10.1016/j.tcs.2023.114114

Web of Science

Scopus

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2310.01983

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2310.05139

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2310.05494

researchmap

Repository Public URL： https://hdl.handle.net/2324/7347458

Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Wiley  

Abstract

To develop and implement effective policies to mitigate climate change, it is important to understand the emission profile of sectors that comprise the network of global supply chains. Focusing on the relationship between sectors’ positions in the global supply chain, this study develops a structural position analysis framework based on input–output analysis. Our framework reveals the highest‐priority sectors and transactions, and the best strategies for CO₂ emission reduction in the global supply chain. The strategies identified focus on cross‐border transactions and highlight the need for inter‐sectoral and international collaboration. The results indicate that the United States and China have different priorities and characteristics (even vis‐à‐vis the same industry), and that joint emission reduction policies should be coordinated to take advantage of each country's emission reduction potential. Our findings suggest that, in the United States and Europe, policies to promote the reduction of direct emissions from production of goods for exports through carbon taxes are important. Contrarily, in Asian countries, carbon emissions originate mainly from intermediate goods trades, suggesting the need for mandatory life cycle assessment reporting and emissions disclosure. Our analytical framework thus proposes specific policies that could effectively reduce specific sectors' and transactions’ carbon footprints.

DOI： 10.1111/jiec.13428

Web of Science

Scopus

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2307.02787

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

Finding a emph{single} best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world problems as objective functions and constraints are only ``approximately'' formulated for original real-world problems. To solve this issue, finding emph{multiple} solutions is a natural direction, and diversity of solutions is an important concept in this context. Unfortunately, finding diverse solutions is much harder than finding a single solution. To cope with the difficulty, we investigate the approximability of finding diverse solutions. As a main result, we propose a framework to design approximation algorithms for finding diverse solutions, which yields several outcomes including constant-factor approximation algorithms for finding diverse matchings in graphs and diverse common bases in two matroids and PTASes for finding diverse minimum cuts and interval schedulings.

DOI： 10.1609/aaai.v37i4.25511

Language：Others   Publishing type：Research paper (other academic)  

For an undirected graph G = ( V , E ) and a k-nonnegative integer vector p = ( p 1 , … , p k ) , a mapping l : V → N ∪ { 0 } is called an L ( p ) -labeling of G if | l ( u ) − l ( v ) | ≥ p d for any two distinct vertices u , v ∈ V with distance d, and the maximum value of { l ( v ) ∣ v ∈ V } is called the span of l. Originally, L ( p ) -labeling of G for p = ( 2 , 1 ) is introduced in the context of frequency assignment in radio networks, where 'close' transmitters must receive different frequencies and 'very close' transmitters must receive frequencies that are at least two frequencies apart so that they can avoid interference. L ( p ) LABELING is the problem of finding the minimum span λ p among L ( p ) -labelings of G, which is NP-hard for every non-zero p. L ( p ) -LABELING is well studied for specific p 's; in particular, many (exact or approximation) algorithms for general graphs or restricted classes of graphs are proposed for p = ( 2 , 1 ) or more generally p = ( p , q ) . Unfortunately, most algorithms strongly depend on the values of p, and it is not apparent to extend algorithms for p to ones for another p ′ in general. In this paper, we give a simple polynomial-time reduction of L ( p ) -LABELING on graphs with a small diameter to METRIC (PATH) TSP, which enables us to use numerous results on (METRIC) TSP. On the practical side, we can utilize various high-performance heuristics for TSP, such as Concordo and LKH, to solve our problem. On the theoretical side, we can see that the problem for any p under this framework is 1.5 -approximable, and it can be solved by the Held-Karp algorithm in O ( 2 n n 2 ) time, where n is the number of vertices, and so on.

DOI： 10.1109/IPDPSW59300.2023.00059

Language：English   Publishing type：Research paper (international conference proceedings)  

Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

DOI： 10.11517/jjsai.38.2_172

CiNii Research

Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Centre pour la Communication Scientifique Directe (CCSD)  

We study a family of generalizations of Edge Dominating Set on directedgraphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc$(u,v)$ is said to dominate itself, as well as all arcs which are at distanceat most $q$ from $v$, or at distance at most $p$ to $u$. First, we give significantly improved FPT algorithms for the two mostimportant cases of the problem, $(0,1)$-dEDS and $(1,1)$-dEDS (that correspondto versions of Dominating Set on line graphs), as well as polynomial kernels.We also improve the best-known approximation for these cases from logarithmicto constant. In addition, we show that $(p,q)$-dEDS is FPT parameterized by$p+q+tw$, but W-hard parameterized by $tw$ (even if the size of the optimal isadded as a second parameter), where $tw$ is the treewidth of the underlyinggraph of the input. We then go on to focus on the complexity of the problem on tournaments. Here,we provide a complete classification for every possible fixed value of $p,q$,which shows that the problem exhibits a surprising behavior, including caseswhich are in P; cases which are solvable in quasi-polynomial time but not in P;and a single case $(p=q=1)$ which is NP-hard (under randomized reductions) andcannot be solved in sub-exponential time, under standard assumptions.

DOI： 10.46298/dmtcs.5378

Scopus

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2303.01290

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2302.06983

researchmap

Publishing type：Research paper (scientific journal)   Publisher：Springer Science and Business Media LLC  

Densestk-Subgraph is the problem to find a vertex subset S of size k such that the number of edges in the subgraph induced by S is maximized. In this paper, we show that Densestk-Subgraph is fixed parameter tractable when parameterized by neighborhood diversity, block deletion number, distance-hereditary deletion number, and cograph deletion number, respectively. Furthermore, we give a 2-approximation 2 tc(G)/2nO(1)-time algorithm where tc(G) is the twin cover number of an input graph G.

DOI： 10.1007/s10878-022-00927-1

Web of Science

Scopus

researchmap

Other Link： https://link.springer.com/article/10.1007/s10878-022-00927-1/fulltext.html

CiNii Research

CiNii Research

Language：English   Publishing type：Research paper (scientific journal)  

DOI： https://doi.org/10.1007/s10878-022-00927-1

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Discrete Applied Mathematics  

The competitive diffusion game is a game-theoretic model of information spreading on a graph proposed by Alon et al. (2010). It models the diffusion process of information in social networks where several competitive companies want to spread their information, for example. The nature of this game strongly depends on the graph topology, and the relationship is studied from several aspects. In this paper, we investigate the existence of a pure Nash equilibrium of the two-player competitive diffusion game on chordal and its related graphs. We show that a pure Nash equilibrium always exists on split graphs, block graphs, and interval graphs, all of which are well-known subclasses of chordal graphs. On the other hand, we show that a pure Nash equilibrium does not always exist on (strongly) chordal graphs; the boundary of the existence of a pure Nash equilibrium is found.

DOI： 10.1016/j.dam.2022.04.025

Web of Science

Scopus

researchmap

Language：English   Publishing type：Research paper (other academic)  

Hedonic Games and Treewidth Revisited

DOI： 10.4230/LIPIcs.ESA.2022.64

Repository Public URL： https://hdl.handle.net/2324/7348038

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

DOI： 10.2139/ssrn.4113601

researchmap

Language：Others   Publishing type：Research paper (scientific journal)  

Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study the following type of problems: given an integer k, the problem asks for k solutions such that the sum of pairwise (weighted) Hamming distances between these solutions is maximized. Such solutions are called diverse solutions. We present a polynomial-time algorithm for finding diverse shortest st-paths in weighted directed graphs. Moreover, we study the diverse version of other classical combinatorial problems such as diverse weighted matroid bases, diverse weighted arborescences, and diverse bipartite matchings. We show that these problems can be solved in polynomial time as well. To evaluate the practical performance of our algorithm for finding diverse shortest st-paths, we conduct a computational experiment with synthetic and real-world instances. The experiment shows that our algorithm successfully computes diverse solutions within reasonable computational time.

DOI： 10.1609/aaai.v36i4.20290

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Journal of Graph Algorithms and Applications  

Given a graph, an L(p, 1)-labeling of the graph is an assignment f from the vertex set to the set of nonnegative integers such that for any pair of vertices u and v, |f(u) − f(v)| ≥ p if u and v are adjacent, and f(u) ≠ f(v) if u and v are at distance 2. The L(p, 1)-labeling problem is to minimize the span of f (i.e.,maxu∈V (f(u)) − minu∈V (f(u)) + 1). It is known to be NP-hard even for graphs of maximum degree 3 or graphs with tree-width 2, whereas it is fixed-parameter tractable with respect to vertex cover number. Since the vertex cover number is a kind of the strongest parameter, there is a large gap between tractability and intractability from the viewpoint of parameterization. To fill up the gap, in this paper, we propose new fixed-parameter algorithms for L(p, 1)-Labeling by the twin cover number plus the maximum clique size and by the tree-width plus the maximum degree. These algorithms reduce the gap in terms of several combinations of parameters.

DOI： 10.7155/jgaa.00592

Scopus

researchmap

Language：English   Publishing type：Research paper (other academic)  

Language：English   Publishing type：Research paper (other academic)   Publisher：Springer  

Cram, Domineering, and Arc Kayles are well-studied combinatorial games. They are interpreted as edge-selecting-type games on graphs, and the selected edges during a game form a matching. In this paper, we define a generalized game called Colored Arc Kayles, which includes these games. Colored Arc Kayles is played on a graph whose edges are colored in black, white, or gray, and black (resp., white) edges can be selected only by the black (resp., white) player, although gray edges can be selected by both black and white players. We first observe that the winner determination for Colored Arc Kayles can be done in O∗(2n) time by a simple algorithm, where n is the order of a graph. We then focus on the vertex cover number, which is linearly related to the number of turns, and show that Colored Arc Kayles, BW-Arc Kayles, and Arc Kayles are solved in time O∗(1.4143τ2+3.17τ), O∗(1.3161τ2+4τ), and O∗(1.1893τ2+6.34τ), respectively, where τ is the vertex cover number. Furthermore, we present an O∗((n/ ν+ 1 )ν) -time algorithm for Arc Kayles, where ν is neighborhood diversity. We finally show that Arc Kayles on trees can be solved in O∗(2n2) (= O(1. 4143n) ) time, which improves O∗(3n3) (= O(1. 4423n) ) by a direct adjustment of the analysis of Bodlaender et al.’s O∗(3n3) -time algorithm for Node Kayles.

DOI： 10.1007/978-3-031-06678-8_37

Web of Science

Scopus

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/iwoca/iwoca2022.html#YoshiwatariKHO22

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

DOI： 10.2139/ssrn.4057270

researchmap

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)  

researchmap

Other Link： https://dl.acm.org/doi/10.5555/3535850.3536053

Language：English   Publishing type：Research paper (scientific journal)   Publisher：ROUTLEDGE JOURNALS, TAYLOR & FRANCIS LTD  

Determining the structural positions and characteristics of multi-role sectors is critical for understanding supply chain networks. Thus, in this study, we developed an attribution analysis framework to assess the structure of sectors with multiple roles in a supply chain. Subsequently, we applied the framework in a case study, where the top-ranking Japanese sectors were identified for production-oriented, betweenness-oriented, and consumption-oriented carbon dioxide emission scores. Additionally, these attribution indicators were utilized to identify/visualize the structural positions of sectors. Using company-level data, we also evaluated the structural positions of Japanese companies in relation to their carbon disclosure project (CDP) reporting practices. The results demonstrate that a company's role in the supply chain is unlikely to be related to CDP reporting.

DOI： 10.1080/09535314.2021.1883552

Web of Science

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Theory of Computing Systems  

A cactus is a connected graph that does not contain K4 − e as a minor. Given a graph G = (V,E) and an integer k ≥ 0, Cactus Vertex Deletion (also known as Diamond Hitting Set) is the problem of deciding whether G has a vertex set of size at most k whose removal leaves a forest of cacti. The previously best deterministic parameterized algorithm for this problem was due to Bonnet et al. [WG 2016], which runs in time 26knO(1), where n is the number of vertices of G. In this paper, we design a deterministic algorithm for Cactus Vertex Deletion, which runs in time 17.64knO(1). As an almost straightforward application of our algorithm, we also give a deterministic 17.64knO(1)-time algorithm for Even Cycle Transversal, which improves the previous running time 50knO(1) of the known deterministic parameterized algorithm due to Misra et al. [WG 2012].

DOI： 10.1007/s00224-022-10076-x

Scopus

researchmap

Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Journal of Computer and System Sciences  

We study the approximability of the NP-complete MAXIMUM MINIMAL FEEDBACK VERTEX SET problem. Informally, this natural problem seems to lie in an intermediate space between two more well-studied problems of this type: MAXIMUM MINIMAL VERTEX COVER, for which the best achievable approximation ratio is n, and UPPER DOMINATING SET, which does not admit any n1−ϵ approximation. We confirm and quantify this intuition by showing the first non-trivial polynomial time approximation for MAXIMUM MINIMAL FEEDBACK VERTEX SET with a ratio of O(n2/3), as well as a matching hardness of approximation bound of n2/3−ϵ, improving the previously known hardness of n1/2−ϵ. Having settled the problem's approximability in polynomial time, we move to the context of super-polynomial time. We devise a generalization of our approximation algorithm which, for any desired approximation ratio r, produces an r-approximate solution in time nO(n/r3/2). This time-approximation trade-off is essentially tight under the ETH.

DOI： 10.1016/j.jcss.2021.09.001

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Theoretical Computer Science  

For problems intractable on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained algorithmic and complexity results. Although the studies in this direction are successful, we still need a systematic way for further investigations because the graphs of bounded vertex cover number form a rather small subclass of graphs of bounded treedepth. To fill this gap, we use another graph parameter, vertex integrity, which is placed between the two parameters mentioned above. For several graph problems, we generalize fixed-parameter tractability results parameterized by vertex cover number to the ones parameterized by vertex integrity. We also show some finer complexity contrasts by showing hardness with respect to vertex integrity or treedepth.

DOI： 10.1016/j.tcs.2022.03.021

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：ROUTLEDGE JOURNALS, TAYLOR & FRANCIS LTD  

Two frameworks, hypothetical extraction and betweenness centrality analysis, can be used to identify environmentally important sectors in complex supply chains. This study derives an analytic expression for the relationship between hypothetical extraction and betweenness centrality analysis. Second, using the Eora and WIOD, this study analyzes the degree of difference in 'important' sectors identified by hypothetical extraction and betweenness centrality analysis. While the results obtained by rank correlation yield similarities, both methods have advantages. This study demonstrates that estimating betweenness centrality is meaningful and less computationally expensive, and can help us to understand the structural positions in the global supply chain network. The hypothetical extraction indicators can be easily computed using the betweenness centrality indicators' mathematical relationship. We conclude that the implementation of effective CO2-reduction polices through greener global supply chain engagement center around two key sectors, chemical and metal products from China, and their higher betweenness centrality should be strengthened.

DOI： 10.1080/09535314.2020.1848807

Web of Science

Scopus

researchmap

Language：Others  

Finding a emph{single} best solution is the most common objective in
combinatorial optimization problems. However, such a single solution may not be
applicable to real-world problems as objective functions and constraints are
only "approximately" formulated for original real-world problems. To solve this
issue, finding emph{multiple} solutions is a natural direction, and diversity
of solutions is an important concept in this context. Unfortunately, finding
diverse solutions is much harder than finding a single solution. To cope with
difficulty, we investigate the approximability of finding diverse solutions. As
a main result, we propose a framework to design approximation algorithms for
finding diverse solutions, which yields several outcomes including
constant-factor approximation algorithms for finding diverse matchings in
graphs and diverse common bases in two matroids and PTASes for finding diverse
minimum cuts and interval schedulings.

CiNii Research

Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2211.05307

researchmap

Publishing type：Research paper (scientific journal)  

researchmap

Other Link： https://dblp.uni-trier.de/db/journals/corr/corr2202.html#abs-2202-06925

CiNii Research

Web of Science

CiNii Research

Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2207.09803

researchmap

CiNii Research

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.dam.2021.07.005

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Algorithmica  

Given a graph G= (V, E) , A⊆ V, and integers k and ℓ, the (A, ℓ) -Path Packing problem asks to find k vertex-disjoint paths of length exactly ℓ that have endpoints in A and internal points in V\ A. We study the parameterized complexity of this problem with parameters |A|, ℓ, k, treewidth, pathwidth, and their combinations. We present sharp complexity contrasts with respect to these parameters. Among other results, we show that the problem is polynomial-time solvable when ℓ≤ 3 , while it is NP-complete for constant ℓ≥ 4. We also show that the problem is W[1]-hard parameterized by pathwidth+ | A| , while it is fixed-parameter tractable parameterized by treewidth+ ℓ. Additionally, we study a variant called Short A-Path Packing that asks to find k vertex-disjoint paths of length at mostℓ. We show that all our positive results on the exact-length version can be translated to this version and show the hardness of the cases where |A| or ℓ is a constant.

DOI： 10.1007/s00453-021-00875-y

Scopus

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.tcs.2021.04.023

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-75242-2_19

Language：Others   Publishing type：Research paper (other academic)  

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.tcs.2021.03.006

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.tcs.2021.03.023

Language：English   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-68211-8_17

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s00453-020-00789-1

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.4230/LIPIcs.ISAAC.2020.3

Repository Public URL： https://hdl.handle.net/2324/7347461

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-59901-0_3

Language：Japanese  

Algorithms for Finding Diverse Subgraphs

DOI： 10.11517/jsaifpai.113.0_06

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-58150-3_27

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s00453-020-00737-z

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-48966-3_4

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.7155/jgaa.00528

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s00453-020-00700-y

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-39881-1_27

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.tcs.2019.09.018

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-38919-2_52

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s00453-020-00679-6

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-10564-8_10

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.tcs.2019.09.025

Language：Japanese  

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-33792-6_43

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.4230/LIPIcs.IPEC.2019.13

Repository Public URL： https://hdl.handle.net/2324/7348000

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-30786-8_22

Language：Others   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.dam.2018.12.012

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-17402-6_8

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-030-17402-6_4

Language：English   Publishing type：Research paper (other academic)  

DOI： 10.4230/LIPIcs.MFCS.2018.67

Repository Public URL： https://hdl.handle.net/2324/7348033

Language：English   Publishing type：Research paper (scientific journal)  

To successfully reduce environmental emissions, companies need to expand the scope of their emissions accounting to include entire supply chains. A clustering approach has been used to find emission-intensive industry clusters. However, this approach did not include entire direct and indirect supply chains when forming high emission industry clusters. We propose a new method based on a modified normalized cut function with Leontief's input-output model and basic clustering algorithms to find industry clusters with high levels of embodied within-cluster emissions that are well separated in the supply chain network. We use this method to identify 58 carbon-intensive clusters of Japanese industries and visualize the within-cluster supply chains in terms of embodied carbon flows. We recommend that companies collaborate within clusters to reduce environmental emissions. Our results provide new insights on where to target emissions reduction actions and technology development within industrial supply chains.

DOI： 10.1080/09535314.2018.1492369

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-319-94776-1_36

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.4230/LIPIcs.SWAT.2018.24

Repository Public URL： https://hdl.handle.net/2324/7348036

Language：Japanese  

DOI： 10.15017/1916258

Language：Japanese  

座談会 肩肘を張らない、緩やかな域学連携(福岡県八女市)

DOI： 10.15017/1917861

Language：English   Publishing type：Research paper (other academic)  

DOI： 10.4230/LIPIcs.ISAAC.2017.45

Repository Public URL： https://hdl.handle.net/2324/7347998

Language：English   Publishing type：Research paper (scientific journal)  

In this article, we develop an economic network analysis to find environmentally critical transmission sectors, transactions and paths in global supply chain networks. The edge betweenness centrality in the global supply chain networks is newly formulated and a relationship between edge betweenness centrality and vertex betweenness centrality is further provided. The empirical analysis based on the world input-output database covering 35 industrial sectors and 41 countries and regions in 2008 shows that specifically, China's Electrical and Optical Equipment sector, which has a higher edge and vertex betweenness centrality, is the most critical sector in global supply chain networks in terms of spreading CO2 emissions along its supply chain paths. We suggest greener supply chain engagement centered around the China's Electrical and Optical Equipment sector and other key sectors identified in this study. (C) 2017 Elsevier B.V. All rights reserved.

DOI： 10.1016/j.eneco.2017.09.012

Language：Others   Publishing type：Research paper (other academic)  

DOI： 10.1007/978-3-319-55911-7_22

Language：Japanese  

座談会 決断科学で統治モジュールが目指すもの

DOI： 10.15017/1910477

Language：Japanese  

まちづくりにおける意思決定モデルの構築

Language：English   Publishing type：Research paper (other academic)  

A Fixed Parameter Algorithm for Max Edge Domination

Language：Others   Publishing type：Research paper (other academic)  

Language：Japanese  

Language：Japanese  

Country：Other  

有向支配集合問題に関する考察

Language：Japanese  

Country：Other  

三角形総個数最大化問題

Language：Japanese  

Country：Other  

ネットワークの社会的距離に基づく最適分割

Language：Japanese  

Venue：京都   Country：Other  

三角形数を最大・最小にする三角化

Language：Japanese  

Venue：長崎   Country：Other  

社会的距離に基づく木の最適分割

Language：Japanese  

Venue：長崎   Country：Other  

席替え問題に対する安定解・最適解の実験的評価

Language：Japanese  

Venue：長崎   Country：Other  

ブロックグラフにおける２人プレイヤー拡散競争ゲームのナッシュ均衡の存在について

Language：Japanese  

Venue：大阪   Country：Other  

Simple-Kalahにおける勝敗確定の十分条件

Language：Japanese  

Venue：大阪   Country：Other  

Simple-Kalahにおける勝敗確定の十分条件

Language：Japanese  

Venue：名古屋   Country：Other  

社会的距離に基づく木の最適分割

Language：Japanese  

Venue：茨城   Country：Other  

スプリットグラフにおける2人プレイヤー拡散競争ゲームのナッシュ均衡の存在性

Language：Japanese  

Venue：福岡   Country：Other  

社会的距離に基づくグラフ最適分割の計算量

Language：Japanese  

Venue：福岡   Country：Other  

有向辺⽀配集合問題の核と近似

Language：Japanese  

Venue：福岡   Country：Other  

弦グラフ関連クラスにおける拡散競争ゲームのナッシュ均衡の存在性

Language：Japanese  

Venue：福岡   Country：Other  

グラフ制限下のヘドニックゲームにおける安定性探索のPLS完全性

Language：Japanese  

Venue：愛知   Country：Other  

帰属分析を用いた環境経済構造の把握

Language：Japanese  

Venue：京都   Country：Other  

コーダルグラフ関連クラスにおける2人拡散競争ゲームのナッシュ均衡の存在性

Language：Japanese  

Venue：京都   Country：Other  

New Results on Directed Edge Dominating Set

Language：Japanese  

Country：Other  

弦グラフ関連クラスにおける 2 人プレイヤー拡散競争ゲームのナッシュ均衡について

Language：Japanese  

Country：Other  

グラフへドニックゲームに対する総効用最大化 FPT アルゴリズム

Language：English  

Country：Other  

Structural Similarity Analysis based on the Network Characteristics of Sectors

Language：English  

Country：Other  

Edge Clustering for Supply Chain Networks

Language：English  

Country：Other  

Boosting Economic Competitiveness: The Industrial Clusters in Input-Output Networks

Language：Japanese  

Country：Other  

距離効用関数に基づく木の分割アルゴリズムの最適性・安定性

Language：Japanese  

Country：Other  

最大連結カットに対するパラメータ化アルゴリズム

Language：Japanese  

Country：Other  

グラフへドニックゲームにおける総効用最大化 FPT アルゴリズム

Language：Japanese  

Country：Other  

弦グラフ関連クラスにおける 2 人プレイヤー拡散競争ゲームのナッシュ均衡について

Language：Japanese  

Country：Other  

グラフの2等分割問題に対するアルゴリズムと計算複雑性

Language：Japanese  

Country：Other  

構造的パラメータに関する最密部分グラフ問題の固定パラメータ容易性

Language：Japanese  

Country：Other  

疎グラフにおけるヘドニックゲームの計算量

Language：Japanese  

Country：Other  

コーダルグラフ関連クラスにおける2人プレイヤー拡散競争ゲームのナッシュ均衡

Language：Japanese  

Country：Other  

Packing disjoint A-paths with fixed length

Language：Japanese  

Country：Other  

Graph partitioning problems parameterized by vertex integrity

Language：Japanese  

Country：Other  

社会的距離に基づくグラフの安定分割

Language：English  

Country：Other  

Detecting Inter-Industrial Clusters in the Supply Chain Networks to Reduce Embodied Emissions

Language：English  

Country：Other  

Comprehensive analysis of carbon footprint based on the relative location in the global supply chains

Language：Japanese  

Country：Other  

多様な部分グラフを発見するアルゴリズム

Language：Japanese  

Country：Other  

L(p, 1) ラベリングのための固定パラメータアルゴリズム

Language：Japanese  

Country：Other  

Capacitated Network Design Games on a Generalized Fair Allocation Model

Language：Others  

Country：Other  

Language：Japanese  

Country：Other  

Language：Others  

Country：Other  

Language：Japanese  

Country：Other  

Language：Japanese  

Country：Other  

Fixed Parameter Algorithms for L(p,1)-labeling

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Hub Industries in the Global Supply Chains Networks to Reduce Embodied Emissions

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others   Presentation type：Oral presentation (general)  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：English  

Country：Other  

Structural Parameterizations of Vertex Integrity

Language：English  

Country：Other  

On a spectral lower bound of treewidth

Language：English  

Country：Other  

Collecting Balls on a Line by Robots with Limited Energy

Language：Others  

Country：Other  

Language：Others  

Country：Other  

連結グラフ分割問題の劣指数時間アルゴリズム

Language：Others  

Country：Other  

Language：Others  

Country：Other  

SPQR木を利用したビール路問題への解法

Language：Others  

Country：Other  

Optimally shifting intervals under intersection graph models

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：English  

Country：Other  

Upper and Lower Bounds on the Optimal Questions for YOMEN

Language：English  

Country：Other  

The Price of Stability of Fractional Hedonic Games on Graphs with Many Triangles,

Language：English  

Country：Other  

Fixed-Parameter Algorithms for Fixed Cardinality Graph Partitioning Problems on Sparse Graphs

Language：English  

Country：Other  

An improved spectral lower bound of treewidth

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：English  

Country：Other  

Computational complexity of Turning Tiles

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：Others  

Country：Other  

Language：English  

Country：Other  

A new formulation of path-through frequency

Language：Japanese  

Country：Other  

島おこし活動に温度差はあるか？－対馬市を対象とした実態調査

Language：Japanese  

Country：Other  

最大辺支配問題に対する貪欲法の近似率解析

Language：Japanese  

Country：Other  

最大辺支配問題に対する木幅に関する固定パラメータアルゴリズム

Language：English  

Country：Other  

Fixed Parameter Algorithm for Max Edge Domination

Language：Japanese  

Country：Other  

最大辺支配問題に対する固定パラメータアルゴリズム

Language：Japanese  

Country：Other  

最大辺支配問題に対する固定パラメータアルゴリズム

Language：Japanese  

Country：Other  

A Subexponential Fixed Parameter Algorithm for Partial Edge Dominating Set

Language：Japanese  

Country：Other  

A Fixed Parameter Algorithm for Max Edge Domination

Language：Japanese  

Country：Other  

産業連関ネットワーク解析のための疎化処理と閾値の関係について

Language：Japanese  

Country：Other  

産業連関ネットワーク解析のための疎化処理と閾値の関係について

Language：Japanese  

Country：Other  

産業連関ネットワーク解析のための疎化処理と閾値の関係について

Language：Japanese  

Country：Other  

競技ダンスの採点システムの安定性の評価

Language：Japanese  

Country：Other  

家庭用野球ゲームソフトを用いた最適打順の評価

Language：Japanese  

Country：Other  

最大重み極小点カット問題に対する乱択アルゴリズム

Language：English  

Country：Other  

Maximum Weighted Minimal Vertex Separator

Language：Japanese  

Country：Other  

On the Maximum Weight Minimal Separator

Language：Japanese  

Country：Other  

On the Maximum Weight Minimal Separator

Language：Japanese  

Country：Other  

辺媒介中心性に基づくサプライチェーン分析手法

Language：Japanese  

Country：Other  

産業連関分析に対する媒介中心性

Language：Japanese  

Country：Other  

A Clustering Approach for the Identification of Carbon-Intensive Supply Chains

Language：Japanese  

Venue：長崎   Country：Other  

島おこし活動に温度差はあるか？－対馬市を対象とした実態調査－

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

Presentation type：Oral presentation (general)  

researchmap

researchmap

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

researchmap

researchmap

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

Language：English  

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

researchmap

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

researchmap

researchmap

Language：English  

Language：Japanese