Transportation problem on a graph von Asano, Tetsuo

Volltext

Chemical ablation of the left ventricular endocardium reduces ventricular fibrillation inducibility in acute ischemic canine heart von Nitta, Takashi, Asano, Tetsuo, Yajima, Toshimi, Otsuka, Toshiaki, Ishii, Yosuke

Volltext

In-place Algorithm for Erasing a Connected Component in a Binary Image von Asano, Tetsuo

Volltext

Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems von Asano, Tetsuo, Kirkpatrick, David

Volltext

Do We Need a Stack to Erase a Component in a Binary Image? von Asano, Tetsuo

Volltext

Constant-Working-Space Algorithms for Image Processing von Asano, Tetsuo

Volltext

In-Place Linear-Time Algorithms for Euclidean Distance Transform von Asano, Tetsuo, Tanaka, Hiroshi

Volltext

Memory-constrained algorithms for simple polygons von Asano, Tetsuo, Buchin, Kevin, Buchin, Maike, Korman, Matias, Mulzer, Wolfgang, Rote, Günter, Schulz, André

Volltext

Algorithms and Computation: 7th International Symposium, ISAAC '96 Osaka, Japan, December 16–18, 1996 Proceedings von Asano, Tetsuo, Igarashi, Yoshihide, Nagamochi, Hiroshi, Miyano, Satoru, Suri, Subhash

Volltext

Faster computation of the Robinson–Foulds distance between phylogenetic networks von Asano, Tetsuo, Jansson, Jesper, Sadakane, Kunihiko, Uehara, Ryuhei, Valiente, Gabriel

Volltext

Reprint of: Memory-constrained algorithms for simple polygons von Asano, Tetsuo, Buchin, Kevin, Buchin, Maike, Korman, Matias, Mulzer, Wolfgang, Rote, Günter, Schulz, André

Volltext

Reporting All Segment Intersections Using an Arbitrary Sized Work Space von KONAGAYA, Matsuo, ASANO, Tetsuo

Volltext

Constant-work-space algorithms for geometric problems von Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang

Volltext

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons von Asano, Tetsuo, Mulzer, Wolfgang, Wang, Yajun

Volltext

A Small-Space Algorithm for Removing Small Connected Components from a Binary Image von ASANO, Tetsuo, KUMAR, Revant

Volltext

Some theoretical challenges in digital geometry: A perspective von Asano, Tetsuo, Brimkov, Valentin E., Barneva, Reneta P.

Volltext

Algorithms: International Symposium SIGAL '90 Tokyo, Japan, August 16–18, 1990 Proceedings von Asano, Tetsuo, Ibaraki, Toshihide, Imai, Hiroshi, Nishizeki, Takao

Volltext

A New Transportation Problem on a Graph with Sending and Bringing-Back Operations von Asano, Tetsuo

Volltext

Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures von KOWALIK, Lukasz

Volltext

Algorithms and computation: 17th international symposium, ISAAC 2006, Kolkata, India December 18-20, 2006 : proceedings von Asano, Tetsuo

Volltext