Takeaki Uno

According to our database1, Takeaki Uno authored at least 156 papers between 1996 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Sequentially Swapping Colored Tokens on Graphs.
J. Graph Algorithms Appl., 2019

Proximity Search For Maximal Subgraph Enumeration.
CoRR, 2019

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices.
CoRR, 2019

On the dualization in distributive lattices and related problems.
CoRR, 2019

New polynomial delay bounds for maximal subgraph enumeration by proximity search.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Fast Identification of Heavy Hitters by Cached and Packed Group Testing.
Proceedings of the String Processing and Information Retrieval, 2019

Polynomial-Delay Enumeration of Maximal Common Subsequences.
Proceedings of the String Processing and Information Retrieval, 2019

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Max-Min 3-Dispersion Problems.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Time Series Topic Transition Based on Micro-Clustering.
Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2019

2018
Optimization algorithm for k-anonymization of datasets with low information loss.
Int. J. Inf. Sec., 2018

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four.
IEICE Transactions, 2018

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Node Similarity with q -Grams for Real-World Labeled Networks.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Computational Complexity of Robot Arm Simulation Problems.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Efficient Enumeration of Dominating Sets for Sparse Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Exact Algorithms for the Max-Min Dispersion Problem.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Efficient Enumeration of Bipartite Subgraphs in Graphs.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy.
Proceedings of the Combinatorial Optimization and Applications, 2018

Ladder-Lottery Realization.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Hitori Numbers.
JIP, 2017

Sankaku-tori: An Old Western-Japanese Game Played on a Point Set.
JIP, 2017

Counting Minimal Dominating Sets.
Proceedings of the Theory and Applications of Models of Computation, 2017

Listing Maximal Independent Sets with Minimal Space and Bounded Delay.
Proceedings of the String Processing and Information Retrieval, 2017

On Maximal Cliques with Connectivity Constraints in Directed Graphs.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2017

Micro-clustering by data polishing.
Proceedings of the 2017 IEEE International Conference on Big Data, BigData 2017, 2017

2016
Frequent Pattern Mining.
Encyclopedia of Algorithms, 2016

Amortized Analysis on Enumeration Algorithms.
Encyclopedia of Algorithms, 2016

Mining preserving structures in a graph sequence.
Theor. Comput. Sci., 2016

Tight Exact and Approximate Algorithmic Results on Token Swapping.
CoRR, 2016

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.
Comput. Geom., 2016

Approximation and Hardness of Token Swapping.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Swapping labeled tokens on graphs.
Theor. Comput. Sci., 2015

Micro-Clustering: Finding Small Clusters in Large Diversity.
CoRR, 2015

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Constant Time Enumeration by Amortization.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Map merging using cycle consistency check and RANSAC-based spanning tree selection.
Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2015

2014
A 4.31-approximation for the geometric unique coverage problem on unit disks.
Theor. Comput. Sci., 2014

UNO is hard, even for a single player.
Theor. Comput. Sci., 2014

Base-object location problems for base-monotone regions.
Theor. Comput. Sci., 2014

Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms.
Journal of Chemical Information and Modeling, 2014

Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree.
IEICE Transactions, 2014

Efficient algorithms for dualizing large-scale hypergraphs.
Discret. Appl. Math., 2014

A New Approach to Efficient Enumeration by Push-out Amortization.
CoRR, 2014

A Framework for Object Classification in Farfield Videos.
Proceedings of the Wireless Internet - 8th International Conference, 2014

A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

Prediction Model Using Micro-clustering.
Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Enumeration of complete set of flock patterns in trajectories.
Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming, 2014

Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths.
Proceedings of the Discovery Science - 17th International Conference, 2014

2013
Efficient algorithms for a simple network design problem.
Networks, 2013

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression.
Discrete Math., Alg. and Appl., 2013

Base Location Problems for Base-Monotone Regions.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees.
Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories.
Proceedings of the KDIR/KMIS 2013 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval and the International Conference on Knowledge Management and Information Sharing, Vilamoura, Algarve, Portugal, 19, 2013

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph.
Proceedings of the Discovery Science - 16th International Conference, 2013

A New Approach to String Pattern Mining with Approximate Match.
Proceedings of the Discovery Science - 16th International Conference, 2013

Mining-based compression approach of propositional formulae.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Subgraph isomorphism in graph classes.
Discret. Math., 2012

The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
CoRR, 2012

On Complexity of Flooding Games on Graphs with Interval Representations
CoRR, 2012

Finding Maximum Edge Bicliques in Convex Bipartite Graphs.
Algorithmica, 2012

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

On Complexity of Flooding Games on Graphs with Interval Representations.
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

Efficient Computation of Power Indices for Weighted Majority Games.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Pattern Mining from Trajectory GPS Data.
Proceedings of the IIAI International Conference on Advanced Applied Informatics, 2012

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

Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application.
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.
J. Graph Algorithms Appl., 2011

Algorithmic Folding Complexity.
Graphs and Combinatorics, 2011

A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization.
Eur. J. Oper. Res., 2011

A Doubly Exponentially Crumbled Cake.
Electron. Notes Discret. Math., 2011

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.
Proceedings of the Theory and Applications of Models of Computation, 2011

Dominating Set Counting in Graph Classes.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
Enumeration of the perfect sequences of a chordal graph.
Theor. Comput. Sci., 2010

On listing, sampling, and counting the chordal graphs with edge constraints.
Theor. Comput. Sci., 2010

Multi-sorting algorithm for finding pairs of similar short substrings from large-scale string data.
Knowl. Inf. Syst., 2010

Student mental state inference from unintentional body gestures using dynamic Bayesian networks.
J. Multimodal User Interfaces, 2010

Single versus Multiple Sorting in All Pairs Similarity Search.
Proceedings of the 2nd Asian Conference on Machine Learning, 2010

The complexity of UNO
CoRR, 2010

An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem.
Algorithmica, 2010

Improved Bounds for Wireless Localization.
Algorithmica, 2010

Frequentness-Transition Queries for Distinctive Pattern Mining from Time-Segmented Databases.
Proceedings of the SIAM International Conference on Data Mining, 2010

Extracting Promising Sequential Patterns from RFID Data Using the LCM Sequence.
Proceedings of the Knowledge-Based and Intelligent Information and Engineering Systems, 2010

Levelwise Mesh Sparsification for Shortest Path Queries.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

UNO Is Hard, Even for a Single Player.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Découverte d'itemsets fréquents fermés sur architecture multicoeurs.
Proceedings of the Extraction et gestion des connaissances (EGC'2010), 2010

2009
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.
J. Comput. Sci. Technol., 2009

Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method
CoRR, 2009

Transforming spanning trees: A lower bound.
Comput. Geom., 2009

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

Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes.
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.
Proceedings of the SIAM International Conference on Data Mining, 2009

Efficient serial episode mining with minimal occurrences.
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, 2009

2008
A Generalization of Magic Squares with Applications to Digital Halftoning.
Theory Comput. Syst., 2008

Counting the number of independent sets in chordal graphs.
J. Discrete Algorithms, 2008

An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.
Discret. Appl. Math., 2008

Ambiguous Frequent Itemset Mining and Polynomial Delay Enumeration.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

An Efficient Algorithm for Finding Similar Short Substrings from Large Scale String Data.
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.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Probabilistic Prediction of Student Affect from Hand Gestures.
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.
J. Comb. Optim., 2007

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

Matroid representation of clique complexes.
Discret. Appl. Math., 2007

Mining expression-dependent modules in the human interaction network.
BMC Bioinformatics, 2007

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

Efficient Algorithms for Airline Problem.
Proceedings of the Theory and Applications of Models of Computation, 2007

Weighted Substructure Mining for Image Analysis.
Proceedings of the Mining and Learning with Graphs, 2007

Mining Maximal Flexible Patterns in a Sequence.
Proceedings of the New Frontiers in Artificial Intelligence, 2007

An Efficient Algorithm for Enumerating Pseudo Cliques.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining.
Proceedings of the Discovery Science, 10th International Conference, 2007

Time and Space Efficient Discovery of Maximal Geometric Graphs.
Proceedings of the Discovery Science, 10th International Conference, 2007

Towards Knowledge-Based Affective Interaction: Situational Interpretation of Affect.
Proceedings of the Affective Computing and Intelligent Interaction, 2007

2006
Generating Chordal Graphs Included in Given Graphs.
IEICE Transactions, 2006

An O(n log2n) algorithm for the optimal sink location problem in dynamic tree networks.
Discret. Appl. Math., 2006

Listing Chordal Graphs and Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Enumerating Minimal Explanations by Minimal Hitting Set Computation.
Proceedings of the Knowledge Science, 2006

Contradiction Finding and Minimal Recovery for UML Class Diagrams.
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.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

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

Efficient Algorithms for the Electric Power Transaction Problem.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Generating Colored Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Enumerating Minimally Revised Specifications Using Dualization.
Proceedings of the New Frontiers in Artificial Intelligence, 2005

A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.
Proceedings of the Inductive Logic Programming, 15th International Conference, 2005

Generalized Amazons is PSPACE-Complete.
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.
Algorithmica, 2004

Constant Time Generation of Trees with Specified Diameter.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

New Algorithms for Enumerating All Maximal Cliques.
Proceedings of the Algorithm Theory, 2004

An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
Proceedings of the FIMI '04, 2004

An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases.
Proceedings of the Discovery Science, 7th International Conference, 2004

2003
More Efficient Generation of Plane Triangulations.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization.
Proceedings of the FIMI '03, 2003

LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets.
Proceedings of the FIMI '03, 2003

Enumerating Maximal Frequent Sets Using Irredundant Dualization.
Proceedings of the Discovery Science, 6th International Conference, 2003

Discovering Frequent Substructures in Large Unordered Trees.
Proceedings of the Discovery Science, 6th International Conference, 2003

2001
A Fast Algorithm for Enumerating Bipartite Perfect Matchings.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Fast Algorithms to Enumerate All Common Intervals of Two Permutations.
Algorithmica, 2000

1999
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
A New Approach for Speeding Up Enumeration Algorithms.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.
SIAM J. Comput., 1997

A Linear Time Algorithm for Finding a k-Tree Core.
J. Algorithms, 1997

Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996


  Loading...