-
Article
Open AccessLocally checkable problems in rooted trees
Consider any locally checkable labeling problem \(\Pi \) Π in rooted regula...
-
Chapter and Conference Paper
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
This paper investigates the energy complexity of distributed graph problems in multi-hop radio networks, where the energy cost of an algorithm is measured by the maximum number of awake rounds of a vertex. Rec...
-
Article
Open AccessQuantum superposition demonstrated higher-order topological bound states in the continuum
Higher-order topological insulators, as newly found non-trivial materials and structures, possess topological phases beyond the conventional bulk-boundary correspondence. In previous studies, in-gap boundary s...
-
Chapter and Conference Paper
Distributed Graph Problems Through an Automata-Theoretic Lens
The locality of a graph problem is the smallest distance T such that each node can choose its own part of the solution based on its radius-T neighborhood. In many settings, a graph problem can be solved efficient...
-
Article
Unfolding some classes of orthogonal polyhedra of arbitrary genus
Unfolding polyhedra beyond genus zero (i.e., with holes) is challenging, yet it has not been investigated until very recently. We show two types of orthogonal polyhedra of arbitrary genus, namely, well-separat...
-
Chapter and Conference Paper
Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus
Unfolding polyhedra beyond genus zero (i.e., with holes) is challenging, yet it has not been investigated until very recently. We show two types of orthogonal polyhedra of arbitrary genus, namely, well-separat...
-
Chapter and Conference Paper
A New Approach for Contact Graph Representations and Its Applications
A contact graph representation is a classical graph drawing style in which vertices are represented by geometric objects such that edges correspond to contacts between objects. Based on a characterization of s...
-
Chapter and Conference Paper
Unfolding Orthogonal Polyhedra with Linear Refinement
An unfolding of a polyhedron is a single connected planar piece without overlap resulting from cutting and flattening the surface of the polyhedron. Even for orthogonal polyhedra, it is known that edge-unfolding,...
-
Chapter and Conference Paper
Rectilinear Duals Using Monotone Staircase Polygons
A rectilinear dual of a plane graph refers to a partition of a rectangular area into nonoverlap** rectilinear polygonal modules, where each module corresponds to a vertex such that two modules have side-cont...
-
Chapter and Conference Paper
On Orthogonally Convex Drawings of Plane Graphs
We investigate the bend minimization problem with respect to a new drawing style called orthogonally convex drawing, which is orthogonal drawing with an additional requirement that each inner face is drawn as an
