Issue | Title | |
Vol 12, No 1 (2010) | On edge-intersection graphs of k-bend paths in grids | Abstract PDF PostScript |
Therese Biedl, Michal Stern | ||
Vol 17, No 2 (2015) | On graphs double-critical with respect to the colouring number | Abstract PDF |
Matthias Kriesell, Anders Sune Pedersen | ||
Vol 14, No 1 (2012) | On Hamilton-chain saturated uniform hypergraphs | Abstract PDF PostScript |
Andrzej Zak, Aneta Dudek | ||
Vol 16, No 1 (2014) | On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs | Abstract PDF PostScript |
Christian Löwenstein, Dieter Rautenbach, Roman Soták | ||
Vol 10, No 1 (2008) | On Hereditary Helly classes of graphs | Abstract PDF PostScript |
Marina Groshaus, Jayme Luiz Szwarcfiter | ||
Vol 9, No 2 (2007) | On morphisms preserving infinite Lyndon words | Abstract PostScript PDF |
Gwénaël Richomme | ||
Vol 14, No 2 (2012) | On neighbour-distinguishing colourings from lists | Abstract PDF PostScript |
Mirko Hornak, Mariusz Wozniak | ||
Vol 13, No 3 (2011) | On packing of two copies of a hypergraph | Abstract PDF PostScript |
Monika Pilśniak, Mariusz Woźniak | ||
Vol 14, No 2 (2012) | On paths, trails and closed trails in edge-colored graphs | Abstract PDF PostScript |
Laurent Gourvès, Adria Ramos de Lyra, Carlos Alberto Martinhon, Jérôme Monnot | ||
Vol 16, No 3 (2014) | On permutation complexity of fixed points of uniform binary morphisms | Abstract PDF PostScript |
Alexandr Valyuzhenich | ||
Vol 17, No 1 (2015) | On probe co-bipartite and probe diamond-free graphs | Abstract PDF PostScript |
Flavia Bonomo, Celina Miraglia Herrera de Figueiredo, Guillermo Alfredo Durán, Luciano Norberto Grippo, Martín Darío Safe, Jayme Luiz Szwarcfiter | ||
Vol 10, No 1 (2008) | On quadratic residue codes and hyperelliptic curves | Abstract PDF PostScript |
David Joyner | ||
Vol 14, No 2 (2012) | On Quadratic Threshold CSPs | Abstract PDF PostScript |
Per Austrin, Siavosh Benabbas, Avner Magen | ||
Vol 8 (2006) | On Sampling Colorings of Bipartite Graphs | Abstract GZIP Compressed PostScript PostScript PDF original HTML abstract page |
R. Balasubramanian, C. R. Subramanian | ||
Vol 16, No 1 (2014) | On size, radius and minimum degree | Abstract PDF PostScript |
Simon Mukwembi | ||
Vol 17, No 1 (2015) | On substitution tilings of the plane with n-fold rotational symmetry | Abstract PDF |
Gregory Ross Maloney | ||
Vol 17, No 1 (2015) | On the 1-2-3-conjecture | Abstract PDF PostScript |
Akbar Davoodi, Behnaz Omoomi | ||
Vol 9, No 1 (2007) | On the kth Eigenvalues of Trees with Perfect Matchings | Abstract PDF PostScript |
Wai Chee Shiu, An Chang | ||
Vol 14, No 2 (2012) | On the algebraic numbers computable by some generalized Ehrenfest urns | Abstract PDF PostScript |
Marie Albenque, Lucas Gerin | ||
Vol 12, No 2 (2010) | On the analysis of ”simple” 2D stochastic cellular automata | Abstract PDF |
Damien Regnault, Nicolas Schabanel, Eric Thierry | ||
Vol 12, No 3 (2010) | On the asymptotic enumeration of accessible automata | Abstract PDF PostScript |
Elcio Lebensztayn | ||
Vol 13, No 3 (2011) | On the Book Thickness of k-Trees | Abstract PDF PostScript |
Vida Dujmović, David Wood | ||
Vol 16, No 1 (2014) | On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph | Abstract PDF PostScript |
Olivier Baudon, Julien Bensmail, Rafał Kalinowski, Antoni Marczyk, Jakub Przybyło, Mariusz Woźniak | ||
Vol 11, No 2 (2009) | On the Chromatic Number of some Flip Graphs | Abstract PDF PostScript |
Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia | ||
Vol 15, No 3 (2013) | On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up | Abstract PDF PostScript |
Krzysztof Krzywdziński, Dariusz Kowalski | ||
Vol 17, No 3 (2016) | On the complexity of edge-colored subgraph partitioning problems in network optimization | Abstract PDF PostScript |
Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen | ||
Vol 9, No 1 (2007) | On the complexity of the balanced vertex ordering problem | Abstract PDF PostScript |
Jan Kara, Jan Kratochvil, David R. Wood | ||
Vol 13, No 3 (2011) | On the complexity of vertex-coloring edge-weightings | Abstract PDF PostScript |
Andrzej Dudek, David Wajc | ||
Vol 8 (2006) | On the Computability of the Topological Entropy of Subshifts | Abstract PDF PostScript |
Jakob Grue Simonsen | ||
Vol 15, No 3 (2013) | On the connectedness and diameter of a Geometric Johnson Graph | Abstract PDF PostScript |
Crevel Bautista-Santiago, Javier Cano, Ruy Fabila-Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia | ||
Vol 9, No 1 (2007) | On the Critical Exponent of Generalized Thue-Morse Words | Abstract PDF PostScript |
Alexandre Blondin-Massé, Srečko Brlek, Amy Glen, Sébastien Labbé | ||
Vol 17, No 2 (2015) | On the Dynamics of Systems of Urns | Abstract PDF |
Marek Klonowski, Jacek Cichoń, Rafał Kapelko | ||
Vol 15, No 2 (2013) | On the enumeration of d-minimal permutations | Abstract PDF PostScript |
Mathilde Bouvel, Luca Ferrari | ||
Vol 12, No 1 (2010) | On the existence of block-transitive combinatorial designs | Abstract PDF PostScript |
Michael Huber | ||
Vol 17, No 1 (2015) | On the Hausdorff measure of regular ω-languages in Cantor space | Abstract PDF PostScript |
Ludwig Staiger | ||
Vol 10, No 3 (2008) | On the k-Structure Ratio in Planar and Outerplanar Graphs | Abstract PDF PostScript |
Gruia Calinescu, Cristina G. Fernandes | ||
Vol 11, No 1 (2009) | On the length of shortest 2-collapsing words | Abstract PDF PostScript |
Alessandra Cherubini, Andrzej Kisielewicz, Brunetto Piochi | ||
Vol 13, No 4: special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity | On the metric dimension of Grassmann graphs | Abstract PDF PostScript |
Robert F Bailey, Karen Meagher | ||
Vol 16, No 1 (2014) | On the Meyniel condition for hamiltonicity in bipartite digraphs | Abstract PDF PostScript |
Janusz Adamus, Lech Adamus, Anders Yeo | ||
Vol 13, No 4: special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity | On the minimal distance of a polynomial code | Abstract PDF PostScript |
Péter Pál Pach, Csaba Szabó | ||
241 - 280 of 417 Items | << < 2 3 4 5 6 7 8 9 10 11 > >> |
ISSN: 1365-8050