Takeaki Uno

Kouichi Hirata

Proceedings of the Discovery Science - 16th International Conference, 2013

A New Approach to String Pattern Mining with Approximate Match.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science - 16th International Conference, 2013

Mining-based compression approach of propositional formulae.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

Subgraph isomorphism in graph classes.

[BibT_eX]

[DOI]

Discret. Math., 2012

The Algebraic Combinatorial Approach for Low-Rank Matrix Completion

[BibT_eX]

[DOI]

CoRR, 2012

On Complexity of Flooding Games on Graphs with Interval Representations

[BibT_eX]

[DOI]

CoRR, 2012

Finding Maximum Edge Bicliques in Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.

[BibT_eX]

[DOI]

Algorithmica, 2012

On Complexity of Flooding Games on Graphs with Interval Representations.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

Efficient Computation of Power Indices for Weighted Majority Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Pattern Mining from Trajectory GPS Data.

[BibT_eX]

[DOI]

Xiaoliang Geng

Proceedings of the IIAI International Conference on Advanced Applied Informatics, 2012

Hitori Number.

[BibT_eX]

[DOI]

Akira Suzuki

Kei Uchizawa

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Algorithmic Folding Complexity.

[BibT_eX]

[DOI]

Graphs Comb., 2011

A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization.

[BibT_eX]

[DOI]

Benjamin Hellouin de Menibus

Eur. J. Oper. Res., 2011

A Doubly Exponentially Crumbled Cake.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

Dominating Set Counting in Graph Classes.

[BibT_eX]

[DOI]

Shuji Kijima

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Enumeration of the perfect sequences of a chordal graph.

[BibT_eX]

[DOI]

Yasuko Matsui

Theor. Comput. Sci., 2010

On listing, sampling, and counting the chordal graphs with edge constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2010

Student mental state inference from unintentional body gestures using dynamic Bayesian networks.

[BibT_eX]

[DOI]

J. Multimodal User Interfaces, 2010

Single versus Multiple Sorting in All Pairs Similarity Search.

[BibT_eX]

[DOI]

Proceedings of the 2nd Asian Conference on Machine Learning, 2010

The complexity of UNO

[BibT_eX]

[DOI]

CoRR, 2010

An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem.

[BibT_eX]

[DOI]

Algorithmica, 2010

Improved Bounds for Wireless Localization.

[BibT_eX]

[DOI]

Algorithmica, 2010

Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases.

[BibT_eX]

[DOI]

Shin-ichi Minato

Proceedings of the SIAM International Conference on Data Mining, 2010

Extracting Promising Sequential Patterns from RFID Data Using the LCM Sequence.

[BibT_eX]

[DOI]

Takanobu Nakahara

Katsutoshi Yada

Proceedings of the Knowledge-Based and Intelligent Information and Engineering Systems, 2010

Levelwise Mesh Sparsification for Shortest Path Queries.

[BibT_eX]

[DOI]

Yuichiro Miyamoto

Mikio Kubo

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses.

[BibT_eX]

[DOI]

Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

UNO Is Hard, Even for a Single Player.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Découverte d'itemsets fréquents fermés sur architecture multicoeurs.

[BibT_eX]

[DOI]

Proceedings of the Extraction et gestion des connaissances (EGC'2010), 2010

2009

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2009

Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method

[BibT_eX]

[DOI]

Masashi Sugiyama

Koji Tsuda

CoRR, 2009

Transforming spanning trees: A lower bound.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Enumeration of condition-dependent dense modules in protein interaction networks.

[BibT_eX]

[DOI]

Bioinform., 2009

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.

[BibT_eX]

[DOI]

Proceedings of the SIAM International Conference on Data Mining, 2009

Efficient serial episode mining with minimal occurrences.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, 2009

2008

A Generalization of Magic Squares with Applications to Digital Halftoning.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Counting the number of independent sets in chordal graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

LCM over ZBDDs: Fast Generation of Very Large-Scale Frequent Itemsets Using a Compact Graph-Based Representation.

[BibT_eX]

[DOI]

Shin-ichi Minato

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Probabilistic Prediction of Student Affect from Hand Gestures.

[BibT_eX]

Proceedings of the International Conference on Automation, Robotics and Control Systems, 2008

2007

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information.

[BibT_eX]

[DOI]

J. Chem. Inf. Model., 2007

Matroid representation of clique complexes.

[BibT_eX]

[DOI]

Kenji Kashiwabara

Discret. Appl. Math., 2007

Mining expression-dependent modules in the human interaction network.

[BibT_eX]

[DOI]

BMC Bioinform., 2007

Mining complex genotypic features for predicting HIV-1 drug resistance.

[BibT_eX]

[DOI]

Hiroto Saigo

Koji Tsuda

Bioinform., 2007

Efficient Algorithms for Airline Problem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

Mining Maximal Flexible Patterns in a Sequence.

[BibT_eX]

[DOI]

Proceedings of the New Frontiers in Artificial Intelligence, 2007

An Efficient Algorithm for Enumerating Pseudo Cliques.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 10th International Conference, 2007

Time and Space Efficient Discovery of Maximal Geometric Graphs.

[BibT_eX]

[DOI]

Shinichi Shimozono

Proceedings of the Discovery Science, 10th International Conference, 2007

Weighted Substructure Mining for Image Analysis.

[BibT_eX]

[DOI]

Proceedings of the 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 2007

Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect.

[BibT_eX]

[DOI]

Proceedings of the Affective Computing and Intelligent Interaction, 2007

2006

Generating Chordal Graphs Included in Given Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Listing Chordal Graphs and Interval Graphs.

[BibT_eX]

[DOI]

Shuji Kijima

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Enumerating Minimal Explanations by Minimal Hitting Set Computation.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, 2006

Contradiction Finding and Minimal Recovery for UML Class Diagrams.

[BibT_eX]

[DOI]

Ken Kaneiwa

Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering (ASE 2006), 2006

Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints.

[BibT_eX]

[DOI]

Transp. Sci., 2005

Efficient Algorithms for the Electric Power Transaction Problem.

[BibT_eX]

[DOI]

Tomomi Matsui

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Generating Colored Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Enumerating Minimally Revised Specifications Using Dualization.

[BibT_eX]

[DOI]

Proceedings of the New Frontiers in Artificial Intelligence, 2005

A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.

[BibT_eX]

[DOI]

Proceedings of the Inductive Logic Programming, 15th International Conference, 2005

Generalized Amazons is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004

Labeling Points with Weights.

[BibT_eX]

[DOI]

Algorithmica, 2004

Constant Time Generation of Trees with Specified Diameter.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

New Algorithms for Enumerating All Maximal Cliques.

[BibT_eX]

[DOI]

Kazuhisa Makino

Proceedings of the Algorithm Theory, 2004

An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets

[BibT_eX]

[DOI]

Proceedings of the FIMI '04, 2004

An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 7th International Conference, 2004

2003

More Efficient Generation of Plane Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization.

[BibT_eX]

[DOI]

Proceedings of the FIMI '03, 2003

LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.

[BibT_eX]

[DOI]

Proceedings of the FIMI '03, 2003

Enumerating Maximal Frequent Sets Using Irredundant Dualization.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 6th International Conference, 2003

Discovering Frequent Substructures in Large Unordered Trees.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 6th International Conference, 2003

2001

A Fast Algorithm for Enumerating Bipartite Perfect Matchings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Fast Algorithms to Enumerate All Common Intervals of Two Permutations.

[BibT_eX]

[DOI]

Mutsunori Yagiura

Algorithmica, 2000

1999

A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

A New Approach for Speeding Up Enumeration Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.

[BibT_eX]

[DOI]

Akiyoshi Shioura

Akihisa Tamura

SIAM J. Comput., 1997

A Linear Time Algorithm for Finding a k-Tree Core.

[BibT_eX]

[DOI]

Akiyoshi Shioura

J. Algorithms, 1997

Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph.

[BibT_eX]

[DOI]