Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEuropean Journal of Combinatorics, Volume 34
Volume 34, Number 1, January 2013
- Jan Kratochvíl
, Mirka Miller:
Preface. 1-2 - W. F. Smyth:
Computing regularities in strings: A survey. 3-14 - Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Computing the Longest Previous Factor. 15-26 - Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximum number of cubic subwords in a word. 27-37 - Kimmo Fredriksson, Szymon Grabowski:
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. 38-51 - Petr Procházka, Jan Holub:
ODC: Frame for definition of Dense codes. 52-68 - Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Linear time construction of a compressed Gray code. 69-81 - Pawel Gawrychowski, Travis Gagie:
Minimax trees in linear time with applications. 82-90 - Peyman Nayeri, Charles J. Colbourn, Goran Konjevod:
Randomized post-optimization of covering arrays. 91-103 - Sylwia Cichacz, Dalibor Froncek, Petr Kovár:
Decomposition of complete bipartite graphs into generalized prisms. 104-110 - Ján Karabás, Edita Mácajová, Roman Nedela:
6-decomposition of snarks. 111-122 - Michael Drmota:
Embedded trees and the support of the ISE. 123-137 - Thomas Feierl:
The height and range of watermelons without wall. 138-154
Volume 34, Number 2, February 2013
- Geir Agnarsson:
Induced subgraphs of hypercubes. 155-168 - Bostjan Frelih, Klavdija Kutnar:
Classification of cubic symmetric tetracirculants and pentacirculants. 169-194 - Jernej Tonejc:
More balancing for distance-regular graphs. 195-206 - S. M. Anvariyeh, S. Mirvakili, Bijan Davvaz:
Combinatorial aspects of n-ary polygroups and n-ary color schemes. 207-216 - Michael A. Henning, Anders Yeo:
Transversals and matchings in 3-uniform hypergraphs. 217-228 - Otfried Cheong, Xavier Goaoc, Cyril Nicaud:
Set systems and families of permutations with small traces. 229-239 - Tibor Jordán, Viktória E. Kaszanitzky:
Highly connected rigidity matroids have unique underlying graphs. 240-247 - Daniel Král', Oriol Serra, Lluís Vena:
On the removal lemma for linear systems over Abelian groups. 248-259 - Mihai Prunescu:
Fp-affine recurrent n-dimensional sequences over Fq are p-automatic. 260-284 - András Gács, Tamás Héger, Zsuzsa Weiner:
On regular graphs of girth six arising from projective planes. 285-296 - Saieed Akbari, Mohammad Reza Oboudi:
On the edge cover polynomial of a graph. 297-321 - Anisse Kasraoui:
New Wilf-equivalence results for vincular patterns. 322-337 - Weifan Wang, Qiaojun Shu, Yiqiao Wang:
A new upper bound on the acyclic chromatic indices of planar graphs. 338-354 - Iain Moffatt:
Separability and the genus of a partial dual. 355-378 - Reza Ameri, Morteza Norouzi:
Prime and primary hyperideals in Krasner (m, n)-hyperrings. 379-390 - Fabien Durand, Michel Rigo:
Multidimensional extension of the Morse-Hedlund theorem. 391-409 - Yong-Gao Chen, Quan-Hui Yang:
Ruzsa's theorem on Erdős and Turán conjecture. 410-413 - Tao Jiang, Kevin G. Milans, Douglas B. West:
Degree Ramsey numbers for cycles and blowups of trees. 414-423 - Joanna A. Ellis-Monaghan, Iain Moffatt:
A Penrose polynomial for embedded graphs. 424-445 - Michal Novák:
Some basic properties of EL-hyperstructures. 446-459 - Sandi Klavzar, Iztok Peterin, Sara Sabrina Zemljic:
Hamming dimension of a graph - The case of Sierpiński graphs. 460-473 - Hal A. Kierstead, Matt Earl Smith:
On first-fit coloring of ladder-free posets. 474-489 - David G. L. Wang, Tongyuan Zhao:
The real-rootedness and log-concavities of coordinator polynomials of Weyl group lattices. 490-494 - Daniela Kühn, Deryk Osthus, Diana Piguet:
Embedding cycles of given length in oriented graphs. 495-501 - János Kincses, Géza Makay, Miklós Maróti, József Osztényi, László Zádori:
A special case of the Stahl conjecture. 502-511 - Shu Jiao Song, Cai Heng Li, Dian Jun Wang:
A family of edge-transitive Frobenius metacirculants of small valency. 512-521 - Bart De Bruyn, Frédéric Vanhove:
Inequalities for regular near polygons, with applications to m-ovoids. 522-538
Volume 34, Number 3, April 2013
- Jan Kratochvíl, Mirka Miller:
Preface. 539-540 - Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond:
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. 541-566 - Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger:
Fully decomposable split graphs. 567-575 - Tínaz Ekim, Pinar Heggernes, Daniel Meister:
Polar permutation graphs are polynomial-time recognisable. 576-592 - Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios:
An O(n)-time algorithm for the paired domination problem on permutation graphs. 593-608 - Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three complexity results on coloring Pk-free graphs. 609-619 - N. R. Aravind, C. R. Subramanian:
Forbidden subgraph colorings and the oriented chromatic number. 620-631 - Edyta Szymanska:
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree. 632-646 - Nicola Apollonio, Massimiliano Caramia:
Mengerian quasi-graphical families and clutters. 647-659 - Petr Skoda:
Computability of width of submodular partition functions. 660-665 - Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle:
Feedback vertex set on graphs of low clique-width. 666-679 - Robert Ganian, Petr Hlinený, Jan Obdrzálek:
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. 680-701
Volume 34, Number 4, May 2013
- Jamie Simpson:
A general two-term recurrence. 703-705 - Koji Momihara:
Strongly regular Cayley graphs, skew Hadamard difference sets, and rationality of relative Gauss sums. 706-723 - Andrzej Zak:
Growth order for the size of smallest hamiltonian chain saturated uniform hypergraphs. 724-735 - Robert F. Bailey, José Cáceres, Delia Garijo, Antonio González Herrera, Alberto Márquez, Karen Meagher, María Luz Puertas:
Resolving sets for Johnson and Kneser graphs. 736-751 - Somayeh Bandari, Jürgen Herzog:
Monomial localizations and polymatroidal ideals. 752-763 - Alexander K. Kelmans, Anatoliy Rubinov:
On convex polytopes in Rd containing and avoiding zero. 764-769 - Jack H. Koolen, Greg Markowsky, Jongyook Park:
On electric resistances for distance-regular graphs. 770-786 - William Y. C. Chen, Ernest X. W. Xia:
Proof of Moll's minimum conjecture. 787-791
Volume 34, Number 5, July 2013
- Nadia Creignou, Hervé Daudé:
Sensitivity of Boolean formulas. 793-805 - Jianhua Yin, Guodong Guo:
The smallest degree sum that yields graphic sequences with a Z3-connected realization. 806-811 - Van Trung Pham, Thi Ha Duong Phan:
Lattices generated by Chip Firing Game models: Criteria and recognition algorithms. 812-832 - Zdenek Dvorák:
Constant-factor approximation of the domination number in sparse graphs. 833-840 - Yong-Gao Chen, Jian-Dong Wu:
The inverse problem on subset sums. 841-845 - Richard H. Hammack:
Cancellation of digraphs over the direct product. 846-858 - Yago Antolín, Laura Ciobanu:
Geodesic growth in right-angled and even Coxeter groups. 859-874 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Minimum degree and disjoint cycles in generalized claw-free graphs. 875-883 - Reza Ameri, Morteza Norouzi:
New fundamental relation of hyperrings. 884-891 - Jin Yan:
Contractible configurations on 3-flows in graphs satisfying the Fan-condition. 892-904 - Shagnik Das, Choongbum Lee, Benny Sudakov:
Rainbow Turán problem for even cycles. 905-915 - Hee Je Cho, Seong-Hun Paeng:
Ollivier's Ricci curvature and the coloring of graphs. 916-922 - Alexey Garber:
Belt diameter of Π-zonotopes. 923-933
Volume 34, Number 6, August 2013
- Jack H. Koolen, Jongyook Park:
A note on distance-regular graphs with a small number of vertices compared to the valency. 935-940 - Cheng Yeaw Ku, Kok Bin Wong:
Solving the Ku-Wales conjecture on the eigenvalues of the derangement graph. 941-956 - Geoff Whittle, Alan Williams:
On preserving matroid 3-connectivity relative to a fixed basis. 957-967 - Kazuto Iijima:
A q-multinomial expansion of LLT coefficients and plethysm multiplicities. 968-986 - Silvia Benvenuti, Riccardo Piergallini:
Automorphisms of trivalent graphs. 987-1009 - Drago Bokal, Markus Chimani, Jesús Leaños:
Crossing number additivity over edge cuts. 1010-1018 - Louis Esperet, Aline Parreau:
Acyclic edge-coloring using entropy compression. 1019-1027 - Bojan Basic:
On highly potential words. 1028-1039 - Chun-Hung Liu, Gexin Yu:
Linear colorings of subcubic graphs. 1040-1050 - Madhusudan Manjunath:
The Laplacian lattice of a graph under a simplicial distance function. 1051-1070
Volume 34, Number 7, October 2013
- Romanos Malikiosis, Máté Matolcsi, Imre Z. Ruzsa:
A note on the pyjama problem. 1071-1077 - Ari Vesanen:
On the group PSL(n, q) as the multiplication group of a loop. 1078-1080 - Shi-Mei Ma:
Some combinatorial arrays generated by context-free grammars. 1081-1091 - Douglas S. Stones:
Symmetries of partial Latin squares. 1092-1107 - Alexander Magazinov:
An upper bound for a valence of a face in a parallelohedral tiling. 1108-1113 - Yotsanan Meemark, Thammanoon Puirod:
Symplectic graphs over finite local rings. 1114-1124 - Bojan Mohar:
Many large eigenvalues in sparse graphs. 1125-1129 - Ian M. Wanless, Xiande Zhang:
Transversals of Latin squares and covering radius of sets of permutations. 1130-1143 - Arturas Dubickas, Tomasz Schoen, Manuel Silva, Paulius Sarka:
Finding large co-Sidon subsets in sets with a given additive energy. 1144-1157 - Klavdija Kutnar, Dragan Marusic, Primoz Sparl, Ru-Ji Wang, Ming-Yao Xu:
Classification of half-arc-transitive graphs of order 4p4p. 1158-1176 - Matthew Hyatt:
Descent polynomials for kk bubble-sortable permutations of type B. 1177-1191 - Michael A. Henning, Anders Yeo:
22-colorings in kk-regular kk-uniform hypergraphs. 1192-1202 - Jaroslav Nesetril, André Raspaud:
Corrigendum to "Preface, EuroComb '09" [European J. Combin. 33 (2012) 685-687]. 1203
Volume 34, Number 8, November 2013
- Alain Plagne, Oriol Serra, Gilles Zémor:
Preface. 1205-1206 - Alain Plagne, Oriol Serra, Gilles Zémor:
Yahya Ould Hamidoune's mathematical journey: A critical review of his work. 1207-1222 - Aida Abiad, Cristina Dalfó, Miguel Angel Fiol:
Algebraic characterizations of regularity properties in bipartite graphs. 1223-1231 - Noga Alon:
The chromatic number of random Cayley graphs. 1232-1243 - Paul Baginski, Alfred Geroldinger, David J. Grynkiewicz, Andreas Philipp:
Products of two atoms in Krull monoids and arithmetical characterizations of class groups. 1244-1268 - Éric Balandraud, Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune:
Subset sums in abelian groups. 1269-1286 - Emmanuel Breuillard, Ben Green, Terence Tao:
A nilpotent Freiman dimension lemma. 1287-1292 - Emmanuel Breuillard, Ben Green:
Contractions and expansion. 1293-1296 - Javier Cilleruelo, Melvyn B. Nathanson:
Dense sets of integers with prescribed representation functions. 1297-1306 - Charles Delorme:
Cayley digraphs and graphs. 1307-1315 - J. A. Dias da Silva, Pedro J. Freitas:
Counting spectral radii of matrices with positive entries. 1316-1325 - Warren Dicks, Oriol Serra:
The Dicks-Ivanov problem and the Hamidoune problem. 1326-1330 - Yushuang Fan, Weidong Gao, Linlin Wang, Qinghai Zhong:
Two zero-sum invariants on finite abelian groups. 1331-1337 - Gregory Freiman, Alexander A. Yudin:
On the measure of large values of the modulus of a trigonometric sum. 1338-1347 - Yahya Ould Hamidoune, Susana-Clara López, Alain Plagne:
Large restricted sumsets in general Abelian groups. 1348-1364 - Norbert Hegyvári, François Hennecart:
Conditional expanding bounds for two-variable functions over prime fields. 1365-1382 - Gyula Károlyi, Roland Paulin:
On the exterior algebra method applied to restricted set addition. 1383-1389 - Michel Las Vergnas:
The Tutte polynomial of a morphism of matroids - 5. Derivatives as generating functions of Tutte activities. 1390-1405 - Anna S. Lladó:
On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity. 1406-1410 - Máté Matolcsi, Imre Z. Ruzsa:
Sets with no solutions to x+y=3zx+y=3z. 1411-1414 - Oscar Ordaz, Alain Plagne, Wolfgang A. Schmid:
Some remarks on barycentric-sum problems over cyclic groups. 1415-1428 - Juanjo Rué:
On polynomial representation functions for multivariate linear forms. 1429-1435 - Oriol Serra, Gilles Zémor:
A structure theorem for small sumsets in nonabelian groups. 1436-1453 - József Solymosi:
Roth-type theorems in finite groups. 1454-1458 - Terence Tao:
Noncommutative sets of small doubling. 1459-1465
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
