掲載
年

タイトル

月

査読の

国内

有/無

/海外

SIAM Journal of Discrete Mathematics, 27,(2013),141-144

有海外

Proceedings of the 24th Annual ACMM. Grohe, Ken-ichi
SIAM Symposium on Discrete
Kawarabayashi and Bruce Reed
Algorithms(SODA2013), (2013), 414--431

有海外

Proceedings of the 24th Annual ACMSIAM Symposium on Discrete
Algorithms(SODA2013), (2013), 985--1003

有海外

Proceedings of the 24th Annual ACMSIAM Symposium on Discrete Algorithms(SODA2013), (2013), 1013--1029

有海外

Proceedings of the 24th Annual ACMSIAM Symposium on Discrete
Algorithms(SODA2013), (2013), 365--377

有

海外

著者
Roman Cada, Shuya Chiba,
Kenta Ozeki, Petr Vrana, andKiyoshi Yoshimoto

掲載誌名、号数

2013{4,5} is not Coverable: a1 Counterexample of KaiserSkrekovski Conjecture

2013

1

A Simple Algorithm for theGraph Minor Decomposition Logic Meets Structural Graph
Theory2013

15-Coloring $K_{3,k}$-Minor-Free
Ken-ichi Kawarabayashi
Graphs2013

Totally odd subdivisions and
1 parity subdivisions: Structures
and Coloring

2013

1

2013

More Compact Oracles for
1 Approximate Distances in
Undirected Planar Graphs

Ken-ichi Kawarabayashi, C.
Sommer and M. Thorup

Proceedings of the 24th Annual ACMSIAM Symposium on Discrete
Algorithms(SODA2013), (2013), 550--563

有

海外

2013

1 List-Coloring Embedded Graphs

Z. Dvorak and Ken-ichi
Kawarabayashi

Proceedings of the 24th Annual ACMSIAM Symposium on Discrete Algorithms(SODA2013), (2013),1004--1012

有

海外

2013

4-Connected Projective Planar
Ken-ichi Kawarabayashi and
1 Graphs Are HamiltonianKenta Ozeki
Connected

Proceedings of the 24th Annual ACMSIAM Symposium on Discrete
Algorithms(SODA2013), (2013), 378--395

有

海外

2013

2

Exact and Approximation
Proceedings of the 30th International
Algorithms for the Maximum
Yoichi Iwata and Yuichi Yoshida Symposium on Theoretical Aspects ofConstraint Satisfaction Problem
Computer Science (STACS 2013)
over the Point Algebra

有

海外

2013

5

The 8th International Conference on
Sparse Linear Complementarity Hanna Sumita, Naonori Kakimura Algorithms and Complexity (CIAC 2013):
Problems
and Kazuhisa Makino
Lecture Notes in Computer Science,
volume 7878, (2013), 358-369

有

海外

2013

Testing subdivision-freeness: —Ken-ichi Kawarabayashi and6 property testing meetsYuichi Yoshidastructural graph theory —Proceedings of the 45th annual ACM
symposium on Symposium on theory ofcomputing (STOC), (2013), 437--446

有

海外

2013

Model Checking for SuccessorK. Eickmeyer, Ken-ichi
6 Invariant First-Order Logic on
Kawarabayashi and S. Kreutzer
Minor-Closed Graph Classes

Proceedings of the 28th Annual IEEE/ACM
Symposium on Logic in Computer Science(LICS 2013), (2013), 134-142

有

海外

2013

6

有

海外

2013

Collective opinion formation
6 model under Bayesian updating Ryosuke Nishi and Naoki Masuda Physical Review E 87, 062123 (2013)and confirmation bias

有

海外

2013

Balancing the Traveling
7 Tournament Problem for
Weekday and Weekend Games

有

海外

2013

7

International Colloquium on Automata,An algebraic characterization of Arnab Bhattacharyya and Yuichi Language and Programming (ICALP):
testable CSPs
YoshidaLecture Notes in Computer Science
volume 7965, (2013), 123-134

有

海外

2013

International Colloquium on Automata,Testing linear-invariant function
Language and Programming (ICALP):
7
Karl Wimmer and Yuichi Yoshidaisomorphism
Lecture Notes in Computer Science
volume 7965, (2013), 840-850

有

海外

2013

Inferring directed static
7 networks of influence fromundirected temporal networks

Taro Takaguchi, Nobuo Sato,
Kazuo Yano, and Naoki Masuda

Proceedings of the IEEE 37th Annual
Computer Software and Applications
Conference (COMPSAC 2013), (2013),
155-156

有

海外

2013

Constant-time approximation
algorithms for the optimum
7
branching problem on sparsegraphsMitsuru Kusumoto, Yuichi
Yoshida and Hiro Ito

International Journal of Networking andComputing 3(2)

有

海外

2013

8

Proceedings of the Twenty-Thirdinternational joint conference on Artificial
Intelligence, (IJCAI), (2013) 2064--2077

有海外

Ken-ichi Kawarabayashi

Packing Directed Cycles
Ken-ichi Kawarabayashi, M.
Through a Specified Vertex Set Krcal, D. Kral and S. Kreutzer

Fast exact shortest-path
distance queries on large
networks by pruned landmark
labeling

Proceedings of the 2013 ACM SIGMOD
Takuya Akiba, Yoichi Iwata, andInternational Conference on Management
Yuichi Yoshida
of Data (SIGMOD), (2013), 349--360

R. Hoshino and Ken-ichi
Kawarabayashi

Danushka Bollegala, Mitsuru
Mining for analogous tuples from
Kusumoto, Yuichi Yoshida, andan entity-relation graphKen-ichi Kawarabayashi

Proceedings of the Twenty-Fifth
Innovative Applications of Artificial
Intelligence Conference(IAAI 2013) (2013)1525-1531

2013

Classified-Distance Based
8 Shape Descriptor for
Application to Image Retrieval

Jinhee Chun, Natsuda
Kaothanthong, Takeshi
Tokuyama

20139Detecting Superbubbles in
Assembly Graphs

2013

9

Observability transitions incorrelated networks

2013

9

Forbidden Subgraphs Generating Shinya Fujita, Michitaka Furuya
Almost the Same Sets
and Kenta Ozeki

2013

Approximating Multi Commodity
Network Design on Graphs ofKord Eickmeyer and Ken-ichi
10Bounded Pathwidth and
Kawarabayashi
Bounded Degree

2013

10

2013

Linear-time enumeration of
maximal k-edge-connected
Takuya Akiba, Yoichi Iwata, and10
subgraphs in large networks by Yuichi Yoshidarandom contraction

2013

All-or-nothing multicommodity
10 flow problem with bounded
fractionality in planar graphs

2013

An Approximation Algorithm for
R. Hoshino and Ken-ichi
11 the Bipartite Traveling
Kawarabayashi
Tournament Problem

2013

11

Testing the supermodular-cut
condition

2013

11

Alonso Gragera Aguaza, JeanA Bounds-Driven Analysis ofFrançois Baffier, Vorapong"Skull and Roses" Cards Game
Suppakitpaisarn

Proceedings of the 15th International
Conference on Computer Analysis of
Images and Patterns (CAIP 2013), Lecture
Notes in Computer Science, volume 8048,(2013), 1-8

有海外

Proceedings of the 13th Workshop on
Taku Onodera, Kunihiko
Algorithms in Bioinformatics:
Sadakane, and Tetsuro Shibuya Lecture Notes in Computer Science
volume 8126, (2013), 338-348

有海外Takehisa Hasegawa, Taro
Takaguchi, and Naoki Masuda

Physical Review E 88, 042809

有海外

Combin. Probab. Comput 22 (2013) 733-748.

有海外Proceedings of the Algorithmic Game
Theory - 6th International Symposium(SAGT 2013):
Lecture Notes in
Computer Science, volume 8146, (2013),
134-145

有

海外

有

海外

Proceedings of the 22nd ACM
international conference on Conference on
information & knowledge management(CIKM), (2013), 909-918

有海外Proceedings of the 54th Annual IEEE
Symposium on Foundations of Computer
Science (FOCS 2013), (2013), 187-196

有海外

Mathematics of Operations Research,
volume 38, issue 4, (2013), 720-728

有海外

Algorithmica

有

海外

ゲームプログラミングワークショップ2013論文集,102-105, (2013-11-01)

有

国内

2013

Proceedings of the 24th International
Computing a WalrasianSymposium on Algorithms andequilibrium in iterative auctions Kazuo, Murota, Akiyoshi Shioura,
12
Computation (ISAAC 2013),
Lecturewith multiple differentiatedZaifu Yang
Notes in Computer Science, volume 8283,
items(2013), 468-478

有

海外

2013

Proceedings of the 24th International
Space-Efficient and DataSymposium on Algorithms andSensitive Polygon
Jinhee Chun, Ricardo Garcia de
12
Computation (ISAAC 2013),
LectureReconstruction Algorithms from Gonzalo, Takeshi Tokuyama
Notes in Computer Science, volume 8283,
Visibility Angle Information(2013), 22-32

有海外

The 25th International Symposium on
Algorithms and Computation (ISAAC),
Lecture Notes in Computer Science
volume 8283, (2013), 435-445

有海外Proceedings of the Twenty-Fifth Annual
ACM-SIAM Symposium on Discrete
Algorithms (SODA 2014), (2014), 72-81

有海外

Journal of Computational Science, 5,January (2014), 1–11

有

海外

有

海外

Proceedings of the Twenty-Fifth Annual
ACM-SIAM Symposium on Discrete
Algorithms (SODA 2014), (2014), 17491761

有海外

Fast and scalable reachability
queries on graphs by pruned
labeling with landmarks andpaths

Proceedings of the 22nd ACM
Yosuke Yano, Takuya Akiba,international conference on Conference on
Yoichi Iwata, and Yuichi Yoshida information & knowledge management(CIKM), (2013) 1601-1606

Ken-ichi Kawarabayashi and
Yusuke Kobayashi

Shin-ichi Tanigawa and Yuichi
YoshidaYasushi Kawase, Xin Han andKazuhisa Makino

2013

12 Unit Cost Buyback Problem

2014

1

2014

Sub-exponential Graph Coloring
M. Lülfesmann and Ken-ichi
1 Algorithm for Stencil-based
Kawarabayashi
Jacobian Computations

2014

Fast Shortest-Path Distance
1 Queries on Road Networks by
Pruned Highway Labeling

2014

1

2014

Approximation Schemes via
Sherali-Adams Hierarchy for
1 Dense Constraint Satisfaction
Problems and Assignment
Problems

Yuan Zhou and Yuichi Yoshida

Proceedings of the 5th Innovations in
Theoretical Computer Science (ITCS)(2014) 423--438

有

海外

2014

1 Parameterized Testability

Proceedings of the 5th Innovations in
Kazuo Iwama and Yuichi Yoshida Theoretical Computer Science (ITCS),(2014), 507--516

有海外

An Excluded Grid Theorem for Ken-ichi Kawarabayashi andDigraphs with Forbidden Minors Stephan Kreutzer

Takuya Akiba, Yoichi Iwata, Ken- Proceedings of the Sixteenth Workshop on
ichi Kawarabayashi and Yuki
Algorithm Engineering and Experiments
Kawata(ALENEX 2014), (2014), 147-154

Linear-Time FPT Algorithms via Yoichi Iwata, Keigo Oka and
Network Flow
Yuichi Yoshida

2014

Observation enhances thirdparty punishment only among1people who were not hottempered.

2014

Yutaka Horita and Masanori
Takezawa

Letters on Evolutionary Behavioral
Science, 5(1), (2014), 5--8

有海外

2-edge-Hamiltonian1 connectedness of 4-connected Kenta Ozeki, and P. Vrana
plane graphs

European Journal of Combinatorics, 35,(2014), 432–-448

有

海外

2014

The Generalized Terminal
1
Backup Problem

Attila Bernáth and Yusuke
Kobayashi

Proceedings of the Twenty-Fifth Annual
ACM-SIAM Symposium on Discrete
Algorithms (SODA 2014), (2014), 16781686

有

海外

2014

1

Counting Unique-Sink
Orientations

J. Foniok, B. Gartner, L. Klaus,
and M. Sprecher

Discrete Applied Mathematics, 163(2),(2014), 155–164

有

海外

2014

1

A necessary and sufficientcondition for the existence of a
Yoshimi Egawa and Kenta Ozeki Combinatorica, 34, (2014), 47--60
spanning tree with specified
vertices having large degrees

有

海外

2014

ℓ1-Embeddability of 22 Dimensional ℓ1-Rigid Periodic
Graphs.

Proceedings of the 8th International
Workshop on Algorithms and Computation(WALCOM2014), Lecture Notes in
Computer Science, volume 8344, (2014),
349--360

有

海外

2014

2

A (k+1)-Approximation Robust
Proceedings of the 8th International
Network Flow Algorithm and a Jean-François Baffier, Vorapong Workshop on Algorithms and Computation
Tighter Heuristic Method Using Suppakitpaisarn(WALCOM2014), Lecture Notes in
Iterative Multiroute Flow
Computer Science volume 8344

有

海外

2014

3

Coloring 3-colorable graphs with Ken-ichi Kawarabayashi and M.
o(n^{1/5}) colors
Thorup

Proceedings of the 31st Symposium on
Theoretical Aspects of Computer Science(STACS 2014), (2014), 458—469.

有

海外

2014

Viral spreading of daily
3 information in online social
networks

Tatsuro Kawamoto and Naomichi Physica A: Statistical Mechanics and its
HatanoApplications

有

海外

2014

3 Order-preserving matching

Jinil Kim, Peter Eades, Rudolf
Fleischer, Seok-Hee Hong,
Costas S. Iliopoulos, Kunsoo
Park, Simon J. Puglisi andTakeshi Tokuyama

有

海外

2014

Spanning trees with a bounded
3 number of branch vertices in aclaw-free graphs

Haruhide Matsuda, Kenta Ozeki Graphs and Combinatorics, 30, (2014),
and Tomoki Yamashita
429--437

有

海外

2014

Dynamic and Historical
Shortest-Path Distance Queries Takuya Akiba, Yoichi Iwata and4on Large Evolving Networks by Yuichi Yoshida
Pruned Landmark Labeling

有

海外

2014

Proceedings of the 33rd Annual IEEE
Max-flow min-cut theorem andYusuke Kobayashi and Kensuke International Conference on Computer
4 faster algorithms in a circular
OtsukiCommunications (INFOCOM 2014), (2014),
disk failure model
1635-1643

有

海外

2014

Transition-type change between
an inverted BerezinskiiKosterlitz-Thouless transition Tomoaki Nogawa and Takehisa
4and an abrupt transition in bond Hasegawa
percolation on a randomhierarchical small-world network

有

海外

2014

An excluded half-integral grid
5 theorem for digraphs and the
directed disjoint paths problem

Ken-ichi Kawarabayashi, Yusuke Proceedings of the 46th ACM Symposium
Kobayashi, and Stephanon Theory of Computing (STOC 2014),
Kreutzer(201470-78.

有

海外

2014

Embedding and Canonizing
5 Graphs of Bounded Genus in
Logspace”

Proceedings of the 46th ACM Symposium
Michael Elberfeld and Ken-ichi
on Theory of Computing (STOC 2014),
Kawarabayashi(2014), 383-392

有

海外

2014

5

A Characterization of Locally
Testable Affine-Invariant
Properties via Decomposition
Theorems

Proceedings of the 46th ACM Symposiumon the Theory of Computing (STOC
2014),(2014),154-163

有

海外

2014

5

Generalized Skew
Bisubmodularity: A
Satoru Fujishige, Shin-ichi
Characterization and a Min-Max Tanigawa and Yuichi Yoshida
Theorem

Discrete Optimization, 12, (2014), 1-9

有

海外

2014

Spanning $k$-forests with large
Kenta Ozeki and Takeshi
5 components in $K_{1,k+1}$-free
SugiyamagraphsGraphs and Combinatorics

有

海外

2014

5

Graphs and Combinatorics

有海外

Norie Fu

Yuichi Yoshida

The existence of semi-colorings Michitaka Furuya, M. Kamada
in a graphand Kenta Ozeki

Theoretical Computer Science, 525,
(2014), 68-79

Proceedings of the 23rd International
Conference on World Wide Web (WWW
2014), 237-248

Physical Review E, 89, 042803

2014

5

Removable Paths and Cycles
with Parity Constraints

Ken-ichi Kawarabayashi, O. Lee Journal of Combinatorial Theory Series B,
and Bruce Reed
106 (2014),115--133

有

海外

2014

6

Scalable similarity search for
SimRank

Mitsuru Kusumoto, Takanori
Maehara and Ken-ichi
Kawarabayashi

Proceedings of the 2014 ACM SIGMODInternational Conference on Managementof Data (SIGMOD 2014), (2014), 325-336

有

海外

2014

6

Covering problems in edge- andTakuro Fukunaga
node-weighted graphs

Proceedings of the 14th Scandinavian
Symposium and Workshops on Algorithm
Theory,Lecture Notes in Coputer
Science, volume 8503, (2014), 217-228

有

海外

2014

Optimal Budget Allocation:
6 Theoretical Guarantee andEfficient Algorithm

Tasuku Soma, Naonori Kakimura, Proceeding of the 31st Internatinal
Kazuhiro Inaba and Ken-ichi
Conference on Machine Learning (ICML
Kawarabayashi2014), (2014), 351-359

有

海外

2014

The Query Complexity of
6
Witness Finding

Proceeding of the 9th Internatinal
Computer Science Symposium in Russia
Akinori Kawachi, Benjamin(CSR 2014),
LectureRossman and Osamu Watanabe
Notes in Computer Science volume 8476,(2014), 218-231

有

海外

2014

6

Proceedings of the 46th ACM Symposiumon Theory of Computing (STOC 2014),
203-212.

有

海外

2014

Luis Barba, Otfried Cheong,
Jean-Lou De Carufel, Michael
Gene Dobbins, Rudolf Fleischer,
Weight Balancing on Boundaries Akitoshi Kawamura, Matias
Symposium on Computational Geometry
6
and Skeletons
Korman, Yoshio Okamoto, János 2014: 436
Pach, Yuan Tang, Takeshi
Tokuyama, Sander Verdonschot
and Tianhao Wang

有

海外

2014

A Unified View to Greedy
Jinhee Chun, Akiyoshi Shioura,
6 Geometric Routing Algorithms in Truong Minh Tien and Takeshi
Ad Hoc Networks
Tokuyama

IEICE Transactions on Fundamentals ofElectronics, Communications andComputer Sciences(Algorithms for Sensor Systems
LNCS 7718, 2013, pp 54-65)

有

国内(海外)

Proceedings of the 28th AAAI Conferenceon Artificial Intelligence (AAAI), (2014),
138-144

有海外

Proceedings of the 14th Scandinavian
Symposium and Workshops on Algorithm
Theory (SWAT), (2014), 241-252

有海外

Physical Review E 90(1) 012807

有海外Proceedings of the 41st International
Colloquium on Automata, Languages, andProgramming (ICALP), (2014), 763-774

有

海外

2014

Formulas vs. circuits for small
distance connectivity

Benjamin Rossman

Fast and Accurate Influence
Maximization on Large Networks Naoto Ohsaka, Takuya Akiba,
7 with Pruned Monte-Carlo
Yuichi Yoshida, and Ken-Ichi
Simulations
Kawarabayashi
Fast Dynamic Graph Algorithms
Yoichi Iwata and Keigo Oka
for Parameterized Problems

2014

7

2014

Suppressing epidemics on
Taro Takaguchi, Takehisa
7 networks by exploiting observer
Hasegawa and Yuichi Yoshida
nodes

2014

7

2014

Solving the Traveling
Marc Goerigk, Richard Hoshino,
7 Tournament Problem by Packing Ken-ichi Kawarabayashi andThree-Vertex Paths
Stephan Westphal

Proceedings of the 28th AAAI Conferenceon Artificial Intelligence (AAAI 2014),(2014), 2271-2277

有

海外

2014

A framework of discrete DC
Takanori Maehara and Kazuo
7 programming by discrete convex
Murotaanalysis

Matehmatical Programming

有

海外

2014

Exact Bounds for Steepest
7 Descent Algorithms of Lconvex Function Minimization

Kazuo Murota and Akiyoshi
ShiouraOperations Research Letters, 42 (5), 361366

有

海外

2014

Packing plane spanning trees
8 and paths in complete
geometric graphs

Oswin Aichholzer, Thomas
Hackl, Matias Korman, Marc Van Proceedings of the 26th Canadian
Kreveld, Maarten Löffler,Conference on Computational Geometry
Alexander Pilz, Bettina(CCCG'14), 2014
Speckmann and Emo Welzl

有

海外

2014

8

Proceedings of the 26th Canadian
Conference on Computational Geometry(CCCG'14), 2014

有

海外

2014

Almost Linear-Time Algorithms
for Adaptive Betweenness
8
Yuichi YoshidaCentrality using Hypergraph
Sketches

Proceedings of the 20th ACM SIGKDD
Conference on Knowledge Discovery andData Mining (KDD), (2014), 1416-1425

有

海外

2014

8

有

海外

2014

Proceedings of the 3rd International
Parametric Multiroute Flow and J. F. Baffier, Vorapong
Symposium on Combinatorial Optimization
9 its Application to Robust
Suppakitpaisarn, H. Hiraishi, and (ISCO2014),
LectureNetwork with k Edge Failures
Hiroshi Imai
Notes in Coputer Science, volume 8596,(2014), 26-37

有海外

Testing Forest-Isomorphism in
the Adjacency List Model

Computing the geodesic
centers of a polygonal domain

Dynamics of social balance
under temporal interaction

Mitsuru Kusumoto and Yuichi
YoshidaSang Won Bae, Matias Korman
and Yoshio Okamoto

Ryosuke Nishi and Naoki Masuda Europhysics Letters , 107, 48003

2014

Computing personalized
9 PageRank quickly by exploitinggraph structures

Takanori Maehara, Takuya Akiba, Proceedings of the 40th International
Yoichi Iwata and Ken-ichi
Conference on Very Large Data Bases,
Kawarabayashi(2014), 1023-1034

有

海外

2014

Deliver or hold: Approximation
9 algorithms for the periodic
inventory routing problem

Approximation, Randomization, andCombinatorial Optimization. Algorithms andTakuro Fukunaga, Afshin Nikzad,
Techniques (APPROX/RANDOM 2014),
R. Ravi
Leibniz International Proceedings inInformatics (LIPIcs), Vol. 28, 209-225

有

海外

2014

Robust Approximation of
9
Temporal CSP

Proceedings of the 17th International
Workshop on Approximation Algorithms for
Combinatorial Optimization Problems(APPROX), (2014), 419-432

有

海外

2014

A toughness condition for a
9 spanning tree with bounded
total excesses

Graphs and Combinatorics

有

海外

有

海外

Proceedings of the International
Symposium on Information Theory and Its
Applications (ISITA2014), (2014), 138-142

有海外Proceedings of the 55th Annual
Yuan Li, Alexander Razborov andSymposium on Foundations of Computer
Benjamin Rossman
Science (FOCS 2014)

有海外

Proceedings of the 25th International
Workshop on Combinatorial Algorithms
October, (2014), 15 - 17

有海外

Discontinuity, Nonlinearity, andComplexity, 3, (2014), 319-346

有

海外

2014

10

Base Location Problems forBase-Monotone Regions

Suguru Tamaki and Yuichi
YoshidaKenta Ozeki

Jinhee Chun, Takashi
Horiyama,
Takehiro Ito, Natsuda
Kaothanthong,Hirotaka Ono, Yota Otachi,
Takeshi Tokuyama, Ryuhei
Uehara,Takeaki Uno

Theoretical Computer Science 555(2014), 71-84(7th International Workshop on
Algorithms and Computation (WALCOM
2013)
Lecture Notes in Computer
ScienceVolume 7748, 2013, pp 53-64)

2014

Worst Case Computation Time
10 for Minimal Joint Hamming
Weight Numeral System

2014

10

2014

Deterministic Algorithms for the
Yuma Tamura, Takehiro Ito and
10 Independent Feedback Vertex
Xiao Zhou
Set Problem

2014

10

Critical Phase in Complex
Networks: a Numerical Study

Takehisa Hasegawa, Tomoaki
Nogawa, and Koji Nemoto

2014

11

Speeding up Algorithm for
Maximizing Barrier Coverage
Using Parametric Multiroute
Flow

Proceedings of the 7th Thailand-Japan
Vorapong Suppakitpaisarn and J.
International Academic Conference
Baffier(TJIA2014)

有

国内

2014

11

Instance-privacy Preserving
Crowdsourcing

Hiroshi Kajino, Yukino Baba,
Hisashi Kashima

Proceedings of the 2nd AAAI
Conference on Human Computation
and Crowdsourcing (HCOMP)

有

海外

2014

11

Crowdsourced Data
Analytics: A Case Study ofPredictive ModelingCompetition

Yukino Baba, Nozomi Nori,
Shigeru Saito, Hisashi
Kashima

Proceedings of the 2014 International
Conference on Data Science andAdvanced Analytics (DSAA)

有

海外

2014

11

Spanning closed walks and TSP Ken-ichi Kawarabayashi andin 3-connected planar graphs
Kenta Ozeki

Journal of Combinatorial Theory Series B,
109 (2014), 1--33

有

海外

2014

Maximum Lifetime Coverage
F. Norie, Vorapong
12 Problems with Battery Recovery Suppakitpaisarn, K. Kimura andEffects
N. Kakimura

IEEE Global Communication Conference(GLOBECOM2014)

有

海外

2014

On the ratio of the domination
12 number and the independent
domination number in graphs

Michitaka Furuya, A. Sasaki and Discrete Applied Mathematics, 178, (2014),
Kenta Ozeki
157--159

有

海外

2014

12

Minimum-Cost b-Edge
Dominating Sets on Trees

Takehiro Ito, Naonori Kakimura,The 25th Annual International Symposium
Naoyuki Kamiyama, Yusuke
on Algorithms and Computation (ISAAC)
Kobayashi and Yoshio Okamoto

有

海外

2015

1

The Parameterized Complexityof k-Biclique

Bingkai Lin

Proceeding of ACM-SIAM Symposium on
Discrete Algorithms (SODA)

有

海外

2015

1

Distributed Multiplicative
Weights Methods for DCOP

Daisuke Hatano and Yuichi
Yoshida

有

海外

有

海外

Physical Review E

有海外

Physical Review E 91(1) 012806

有

海外

2015

2015

2015

On the AC0 Complexity of
Subgraph Isomorphism

Vorapong Suppakitpaisarn andHiroshi Imai

Lagrangian Decomposition
Daisuke Hatano, Takuro
1 Algorithm for Allocating
Fukunaga, Takanori Maehara
Marketing Channels
and Ken-ichi Kawarabayashi
Estimating the resolution limit
Tatsuro Kawamoto, Martin
1 of the map equation in
Rosvallcommunity detection
Steady state and mean
Leo Speidel, Renaud
recurrence time for random
1
Lambiotte, Kazuyuki Aihara,walks on stochastic temporal
and Naoki Masuda
networks

Proceedings of the 29th AAAI
Conference on Artificial Intelligence(AAAI), (2015), 2074-2080.
Proceedings of the 29th AAAI
Conference on Artificial Intelligence(AAAI), (2015), 1144-1150

2015

Efficient Top-k Shortest-Path
Distance Queries on Large
1
Networks by Pruned Landmark
Labeling

Takuya Akiba, Takanori Hayashi,Nozomi Nori, Yoichi Iwata, and Proceedings of the 29th AAAI Conference
Yuichi Yoshida
on Artificial Intelligence (AAAI) 2--8

2015

1

2015

Branch-and-Reduce
Exponential/FPT Algorithms in
1
Practice: A Case Study ofVertex Cover

2015

1

2015

Spider covers for prize1 collecting network activation
problem

2015

2

2015

Gross Substitutes Condition andAkiyoshi Shioura and Akihisa
3 Discrete Concavity for MultiTamura
Unit Valuations: A Survey

Danushka Bollegala, Takanori
Learning Word Representations
Maehara, Yuichi Yoshida andfrom Relational Graphs
Ken-ichi Kawarabayashi
Takuya Akiba, Yoichi Iwata

有海外Proceedings of the 29th AAAI Conferenceon Artificial Intelligence (AAAI) 2146-2152

有海外

Proceedings of the SIAM Meeting on
Algorithm Engineering & Experiments(ALENEX), 70--81

有

海外

有

海外

有

海外

有

海外

有

国内(海外)

Spanning k-trees of bipartite M. Kano, K. Ozeki, K. Suzuki,
Electron. J. Combin. 22 (2015) #P1.13
graphsM. Tsugaki, and T. Yamashita

Generalized River Crossing
Problems

2014年度 57件

Takuro Fukunaga

Proceeding of ACM-SIAM Symposium on
Discrete Algorithms (SODA)

Hiro Ito, Stefan Langerman, and Theory of Computing Systems 56(2),Yuichi Yoshida(2015), 418--435
Journal of Operations Research Society ofJapan, 58 (1), 61-103