Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Kano, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the number of plane geometric graphs
Oswin Aichholzer
,
Thomas Hackl
,
Clemens Huemer
,
Ferran Hurtado
,
Hannes Krasser
,
Birgit Vogtenhuber
Graphs and Combinatorics
23
(S1), 2007, pp. 67-84
Bichromatic quadrangulations with Steiner points
Victor Alvarez
,
Toshinori Sakai
,
Jorge Urrutia
Graphs and Combinatorics
23
(S1), 2007, pp. 85-98
Contractible edges in a 4-connected graph with vertices of degree greater than four
Kiyoshi Ando
,
Yoshimi Egawa
Graphs and Combinatorics
23
(S1), 2007, pp. 99-115
Vas̑ek Chvátal: A very short introduction
David Avis
,
Adrian Bondy
,
William Cook
,
Bruce Reed
Graphs and Combinatorics
23
(S1), 2007, pp. 41-65
Enumerating non-crossing minimally rigid frameworks
David Avis
,
Naoki Katoh
,
Makoto Ohsaki
,
Ileana Streinu
,
Shin-ichi Tanigawa
Graphs and Combinatorics
23
(S1), 2007, pp. 117-134
Reduction for 3-connected graphs of minimum degree at least four
Sheng Bau
,
Akira Saito
Graphs and Combinatorics
23
(S1), 2007, pp. 135-144
Opposite-quadrant depth in the plane
Hervé Brönnimann
,
Jonathan Lenchner
,
János Pach
Graphs and Combinatorics
23
(S1), 2007, pp. 145-152
Santa Claus' Towers of Hanoi
Xiaomin Chen
,
Bin Tian
,
Lei Wang
Graphs and Combinatorics
23
(S1), 2007, pp. 153-167
Efficient many-to-many point matching in one dimension
Justin Colannino
,
Mirela Damian
,
Ferran Hurtado
,
Stefan Langerman
,
Henk Meijer
,
Suneeta Ramaswami
,
Diane Souvaine
,
Godfried Toussaint
Graphs and Combinatorics
23
(S1), 2007, pp. 169-178
Epsilon-unfolding orthogonal polyhedra
Mirela Damian
,
Robin Flatland
,
Joseph O'Rourke
Graphs and Combinatorics
23
(S1), 2007, pp. 179-194
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
Erik D. Demaine
,
Martin L. Demaine
Graphs and Combinatorics
23
(S1), 2007, pp. 195-208
An
O(n^3)
-time recognition algorithm for hhds-free graphs
Elaine M. Eschen
,
Chính T. Hoàng
,
R. Sritharan
Graphs and Combinatorics
23
(S1), 2007, pp. 209-231
MIPping closures: An instant survey
Matteo Fischetti
,
Andrea Lodi
Graphs and Combinatorics
23
(S1), 2007, pp. 233-243
Unexpected twists in geometric dissections
Greg N. Frederickson
Graphs and Combinatorics
23
(S1), 2007, pp. 245-258
A method to generate polyominoes and polyiamonds for tilings with rotational symmetry
Hiroshi Fukuda
,
Nobuaki Mutoh
,
Gisaku Nakamura
,
Doris Schattschneider
Graphs and Combinatorics
23
(S1), 2007, pp. 259-267
The story of perfectly orderable graphs
Ryan B. Hayward
Graphs and Combinatorics
23
(S1), 2007, pp. 269-273
On the density of trigraph homomorphisms
Pavol Hell
,
Jarik Nes̑etȓil
Graphs and Combinatorics
23
(S1), 2007, pp. 275-281
Semi-distance codes and Steiner systems
Hiro Ito
,
Midori Kobayashi
,
Gisaku Nakamura
Graphs and Combinatorics
23
(S1), 2007, pp. 283-290
Winning ways of weighted poset games
Hiro Ito
,
Gisaku Nakamura
,
Satoshi Takata
Graphs and Combinatorics
23
(S1), 2007, pp. 291-306
Spanning trees with leaf distance at least four
Atsushi Kaneko
,
M. Kano
,
Kazuhiro Suzuki
Journal of Graph Theory
55
(1), 2007, pp. 83-90
Jin Akiyama: A friend and his mathematics
M. Kano
,
Mari-Jo P. Ruiz
,
Jorge Urrutia
Graphs and Combinatorics
23
(S1), 2007, pp. 1-39
On configurations of solid balls in 3-space: Chromatic numbers and knotted cycles
Hiroshi Maehara
Graphs and Combinatorics
23
(S1), 2007, pp. 307-320
Maximal area sets and harmony
David Rappaport
Graphs and Combinatorics
23
(S1), 2007, pp. 321-329
Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
Sambuddha Roy
,
William Steiger
Graphs and Combinatorics
23
(S1), 2007, pp. 331-341
Covering the convex quadrilaterals of point sets
Toshinori Sakai
,
Jorge Urrutia
Graphs and Combinatorics
23
(S1), 2007, pp. 343-357
Seiten 1
2
>