Preprinti IMFM

Letnik 44 (2006)

1026: Mark de Berg, Sergio Cabello, Sariel Har-Peled: Covering many or few points with unit disks, 44 (2006)

1025: Matt DeVos, Luis Goddyn, Bojan Mohar, Robert Šámal: A quadratic lower bound for subset sums, 44 (2006)

1024: Ken-ichi Kawarabayashi, Bojan Mohar: Star colorings and acyclic colorings of locally planar graphs, 44 (2006)

1023: Bojan Mohar: On the Laplacian coefficients of acyclic graphs, 44 (2006)

1022: Borut Lužar, Riste Škrekovski, Martin Tancer: Injective colorings of planar graphs with few colors, 44 (2006)

1021: Franc Forstnerič: Manifolds of holomorphic mappings from strongly pseudoconvex domains, 44 (2006)

1020: Rok Erman, Suzana Jurečič, Daniel Král', Kris Stopar, Nik Stopar: Optimal real number graph labelings of a subfamily of Kneser graphs, 44 (2006)

1019: Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp: Maximizing the area of overlap of two unions of disks under rigid motion, 44 (2006)

1018: Sergio Cabello, Panos Giannopoulos, Christian Knauer: On the parameterized complexity of d-dimensional point set pattern matching, 44 (2006)

1017: Ignasi Sau, Janez Žerovnik: An optimal permutation routing algorithm for full-duplex hexagonal mesh networks, 44 (2006)

1016: Iztok Banič, Janez Žerovnik: Fault-diameter of Cartesian product of graphs and Cartesian graph bundles, 44 (2006)

1015: Pankaj K. Agarwal , Sergio Cabello, J. Antoni Sellarès, Micha Sharir: Computing a center-transversal line, 44 (2006)

1014: Frédéric Havet, Jean-Sébastien Sereni, Riste Škrekovski: 3-facial colouring of plane graphs, 44 (2006)

1013: Drago Bokal: On the crossing numbers of Cartesian products with trees, 44 (2006)

1012: Drago Bokal: Infinite families of crossing-critical graphs with prescribed average degree and crossing number, 44 (2006)

1011: Ken-ichi Kawarabayashi, Bojan Mohar: Some recent progress and applications in graph minor theory, 44 (2006)

1010: Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar: Locally planar graphs are 5-choosable, 44 (2006)

1009: Ivan Ivanšić, Uroš Milutinović: Closed embeddings into Lipscomb's universal space, 44 (2006)

1008: Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition, 44 (2006)

1007: Ken-ichi Kawarabayashi, Bojan Mohar: Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-close, 44 (2006)

1006: Barbara Drinovec-Drnovšek, Franc Forstnerič: Approximation of holomorphic mappings on strongly pseudoconvex domains, 44 (2006)

1005: Matt DeVos, Javad Ebrahimi, Mohammad Ghebleh, Luis Goddyn, Bojan Mohar, Reza Naserasr: Circular colouring the plane, 44 (2006)

1004: Barbara Drinovec-Drnovšek, Franc Forstnerič: Holomorphic curves in complex spaces, 44 (2006)

1003: Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote: Matching point sets with respect to the Earth Mover's distance, 44 (2006)

1002: Sergio Cabello, J. Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inma Ventura: Reverse facility location problems, 44 (2006)

1001: Zdeněk Dvořák, Riste Škrekovski, T. Valla: Planar graphs of odd-girth at least 9 are homomorphic to Petersen graph, 44 (2006)