| Publication | Date of Publication | Type |
|---|
| Multifold tiles of polyominoes and convex lattice polygons | 2024-04-09 | Paper |
Financial spillovers and macroprudential policies
Open Economies Review | 2021-04-08 | Paper |
Cookie clicker
Graphs and Combinatorics | 2020-04-03 | Paper |
Cookie clicker
Graphs and Combinatorics | 2020-04-03 | Paper |
Twenty years of progress of \(\mathrm{JCDCG}^3\)
Graphs and Combinatorics | 2020-04-03 | Paper |
On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
Computational Complexity | 2020-03-06 | Paper |
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Frontiers in Algorithmics | 2019-04-26 | Paper |
Bumpy pyramid folding
Computational Geometry | 2018-10-31 | Paper |
scientific article; zbMATH DE number 6846422 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-02 | Paper |
How to solve the cake-cutting problem in sublinear time
(available as arXiv preprint) | 2017-07-17 | Paper |
Number of ties and undefeated signs in a generalized janken
Lecture Notes in Computer Science | 2017-02-01 | Paper |
On computational complexity of graph inference from counting
Natural Computing | 2016-04-06 | Paper |
Folding a paper strip to minimize thickness
Journal of Discrete Algorithms | 2016-02-18 | Paper |
Testing outerplanarity of bounded degree graphs
Algorithmica | 2015-09-03 | Paper |
Generalized river crossing problems
Theory of Computing Systems | 2015-05-29 | Paper |
Folding a paper strip to minimize thickness
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Enumeration of isolated cliques and pseudo-cliques
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Testing \(k\)-edge-connectivity of digraphs
Journal of Systems Science and Complexity | 2014-11-11 | Paper |
The complexity of the stamp folding problem
Theoretical Computer Science | 2014-01-10 | Paper |
How to generalize janken -- rock-paper-scissors-king-flea
Computational Geometry and Graphs | 2013-12-06 | Paper |
Helly numbers of polyominoes
Graphs and Combinatorics | 2013-09-26 | Paper |
Constant-time algorithms for sparsity matroids
Automata, Languages, and Programming | 2013-08-12 | Paper |
Improved constant-time approximation algorithms for maximum matchings and other optimization problems
SIAM Journal on Computing | 2012-11-29 | Paper |
Algorithms and complexity of generalized river crossing problems
Lecture Notes in Computer Science | 2012-08-22 | Paper |
Constant-time approximation algorithms for the knapsack problem
Lecture Notes in Computer Science | 2012-07-16 | Paper |
An online algorithm optimally self-tuning to congestion for power management problems
Approximation and Online Algorithms | 2012-07-16 | Paper |
Property testing on \(k\)-vertex-connectivity of graphs
Algorithmica | 2012-04-26 | Paper |
Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\)
Graphs and Combinatorics | 2012-01-24 | Paper |
Making polygons by simple folds and one straight cut
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Complexity of the stamp folding problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
| scientific article; zbMATH DE number 5870356 (Why is no real title available?) | 2011-03-25 | Paper |
Testing outerplanarity of bounded degree graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Comparing hypergraphs by areas of hyperedges drawn on a convex polygon
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Maximum-cover source location problems with objective edge-connectivity three
Mathematical Methods of Operations Research | 2009-09-09 | Paper |
The Multi-Commodity Source Location Problems and the Price of Greed
Journal of Graph Algorithms and Applications | 2009-05-19 | Paper |
Transforming Graphs with the Same Degree Sequence
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
Property Testing on k-Vertex-Connectivity of Graphs
Automata, Languages and Programming | 2008-08-28 | Paper |
Multi-commodity Source Location Problems and Price of Greed
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon
Discrete and Computational Geometry | 2008-03-18 | Paper |
Infinite Series of Generalized Gosper Space Filling Curves
Lecture Notes in Computer Science | 2007-08-28 | Paper |
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order
Lecture Notes in Computer Science | 2007-08-28 | Paper |
Winning ways of weighted poset games
Graphs and Combinatorics | 2007-07-19 | Paper |
Semi-distance codes and Steiner systems
Graphs and Combinatorics | 2007-07-19 | Paper |
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Subdivision of the hierarchy of H-colorable graph classes by circulant graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Two equivalent measures on weighted hypergraphs
Discrete Applied Mathematics | 2007-01-09 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Linear time algorithms for graph search and connectivity determination on complement graphs.
Information Processing Letters | 2006-01-17 | Paper |
| scientific article; zbMATH DE number 2163026 (Why is no real title available?) | 2005-04-29 | Paper |
NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
Journal of the Operations Research Society of Japan | 2005-04-23 | Paper |
Single backup table schemes for shortest-path routing
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2152473 (Why is no real title available?) | 2005-04-05 | Paper |
Avoiding routing loops on the internet
Theory of Computing Systems | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2080258 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1979520 (Why is no real title available?) | 2003-09-14 | Paper |
Sum of edge lengths of a multigraph drawn on a convex polygon
Computational Geometry | 2003-04-28 | Paper |
Source location problems considering vertex-connectivity and edge-connectivity simultaneously
Networks | 2002-12-17 | Paper |
| scientific article; zbMATH DE number 1788717 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1786509 (Why is no real title available?) | 2002-08-21 | Paper |
Minimum cost source location problem with vertex-connectivity requirements in digraphs
Information Processing Letters | 2002-07-25 | Paper |
| Edge connectivity between nodes and node-subsets | 2002-07-21 | Paper |
| scientific article; zbMATH DE number 1507295 (Why is no real title available?) | 2001-11-22 | Paper |
| scientific article; zbMATH DE number 1568064 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1507296 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1404253 (Why is no real title available?) | 2000-02-20 | Paper |
