The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Electronic Notes in Discrete Mathematics"( http://dblp.L3S.de/Venues/Electronic_Notes_in_Discrete_Mathematics )

URL (DBLP): http://dblp.uni-trier.de/db/journals/endm

Publication years (Num. hits)
1999 (100) 2000 (97) 2001 (246) 2002 (73) 2003 (163) 2004 (93) 2005 (276) 2006 (170) 2007 (170) 2008 (112) 2009 (211) 2010 (167) 2011 (168)
Publication types (Num. hits)
article(2046)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 2046 publication records. Showing 2046 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Enno Buß, Hiêp Hàn, Mathias Schacht Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza New branch-and-bound algorithms for k-cardinality tree problems. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luca Gugelmann, Reto Spöhel On Balanced Coloring Games in Random Graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Giuseppe Lancia, Paolo Serafini An effective compact formulation of the max cut problem on sparse graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shinya Fujita, Ken-ichi Kawarabayashi High connectivity keeping connected subgraph. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone Characterizations of Graphs with Stretch Number less than 2. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hervé Hocquard, Mickaël Montassier Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sebastián Urrutia, Abilio Lucena A New Formulation for Spanning Trees. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mónica Braga, Javier Marenco Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sidi Mohamed Sedjelmaci Some Related Functions to Integer GCD and Coprimality. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1George B. Mertzios, Ivona Bezáková Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Archontia C. Giannopoulou, Dimitrios M. Thilikos A min-max theorem for LIFO-search. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi Selfish Square Packing. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Oscar Rojo, Israel Rocha, Vilmar Trevisan Algebraic connectivity on a subclass of caterpillars. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andrea Jiménez, Marcos A. Kiwi Counting perfect matchings in the geometric dual. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1János Körner, Silvia Messuti, Gábor Simonyi Families of Very Different Paths. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mariana S. Escalante, Javier L. Marenco, María del Carmen Varaldo A polyhedral study of the single-item lot-sizing problem with continuous start-up costs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Mahmoud Fouz Asymptotically Optimal Randomized Rumor Spreading. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Linear paths and trees in uniform hypergraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon Finding an induced subdivision of a digraph. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Antal Iványi, János Madarász Perfect hypercubes. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robin Christian, R. Bruce Richter, Gelasio Salazar Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar There is a unique crossing-minimal rectilinear drawing of K18. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hiêp Hàn, Yury Person, Mathias Schacht Note on forcing pairs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tobias Christ, Andrea Francke, Heidi Gebauer, Jirí Matousek, Takeaki Uno A Doubly Exponentially Crumbled Cake. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Harout K. Aydinian, Péter L. Erdös On two-part Sperner systems for regular posets (Extended Abstract). Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich Social Networks Spread Rumors in Sublogarithmic Time. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fabián Riquelme, Andreas Polyméris On the Complexity of the Decisive Problem in Simple and Weighted Games. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pascal Ochem, Alexandre Pinlou Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki Forbidden structures for efficient First-Fit chain partitioning (extended abstract). Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril Contractors for flows. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1M. Cámara, Cristina Dalfó, Josep Fàbrega, Miguel Angel Fiol, Ernest Garriga Edge-distance-regular graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Anna Zych, Davide Bilò New Reoptimization Techniques applied to Steiner Tree Problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nicolas Lerme, Lucas Létocart, François Malgouyres Reduced graphs for min-cut/max-flow approaches in image segmentation. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Javier Marenco, Tomás Tetzlaff Envy-free division of discrete cakes. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov Edge identifying codes. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Edita Mácajová, Edita Rollová On the flow numbers of signed complete and complete bipartite graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mekkia Kouider, Mario Valencia-Pabon On lower bounds for the b-chromatic number of connected bipartite graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Asaf Ferber, Michael Krivelevich Fast embedding of spanning trees in biased Maker-Breaker games. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas A Randomized Version of Ramsey's Theorem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gadi Aleksandrowicz, Gill Barequet The Growth Rate of High-Dimensional Tree Polycubes. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shinya Fujita, Henry Liu, Colton Magnant Rainbow k-connection in Dense Graphs (Extended Abstract). Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Antoni Lozano Symmetry Breaking in Tournaments. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden On the Fiedler value of large planar graphs (Extended abstract). Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nils Hebbinghaus, Anand Srivastav Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract). Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Younjin Kim Minimum Ck-saturated graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pedro Munari, Pablo González-Brevis, Jacek Gondzio A note on the primal-dual column generation method for combinatorial optimization. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jarik Nesetril, Ervin Györi, Attila Sali Preface. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Drmota, Marc Noy Universal exponents and tail estimates in the enumeration of planar maps. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Guillermo Durán, Luciano N. Grippo, Martín Darío Safe Probe interval and probe unit interval graphs on superclasses of cographs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Kenta Ozeki Hamilton cycles in 4-connected troidal triangulations. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maksim Bashov Minimal families in terms of double-sided shadow in the Boolean cube layer. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri Reverse-free codes and permutations. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gabriela R. Argiroffo, Graciela L. Nasini, P. Torres Polynomial instances of the Packing Coloring Problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós Large Bd-free and union-free subfamilies. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1A. N. Martinhão, Emerson L. Monte Carmelo Short coverings and matching in weighted graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vadim E. Levit, Eugen Mandrescu A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Uwe Leck, Ian T. Roberts Minimizing the weight of the union-closure of uniform families of sets. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Victor Campos, C. Linhares Sales, Ana Karolinna Maia, Nicolas Martins, Rudini Menezes Sampaio Restricted coloring problems on graphs with few P'4s. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann Approximating Subdense Instances of Covering Problems. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sounaka Mishra On the Maximum Uniquely Restricted Matching for Bipartite Graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa Two Dimensional Strip Packing with Unloading Constraints. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Mitre Costa Dourado, Guillermo Durán, Luerbio Faria, Luciano N. Grippo, Martín Darío Safe Forbidden subgraphs and the Kőnig property. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luciano L. Silveira, Marcelo H. de Carvalho Ear decompositions of join covered graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marianna Bolla Spectra and structure of weighted graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kim Marshall, Mirka Miller, Joe Ryan Extremal Graphs without Cycles of Length 8 or Less. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Y. Kohayakawa, P. B. Konstadinidis, G. O. Mota On an anti-Ramsey property of random graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Mouny Samy Modeliar Efficient Constraint Propagation for Graph Coloring. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Telma Pará, Simone Dantas, Sylvain Gravier Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Giuseppe Longo, Andrea Sgarro Unruly codes with unruly distances raise (combinatorial) problems. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1D. Sasaki, S. Dantas, C. M. H. de Figueiredo On Coloring Problems of Snark Families. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou 2-distance coloring of sparse graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Roman Glebov, Yury Person, Wilma Weps On Extremal Hypergraphs for Hamiltonian Cycles. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vasco Moço Mano, Enide Andrade Martins, Luís António de Almeida Vieira Feasibility Conditions on the Parameters of a Strongly Regular Graph. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pablo De Caria, Marisa Gutierrez Comparing trees characteristic to chordal and dually chordal graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pavle V. M. Blagojevic, Boris Bukh, Roman N. Karasev Turán numbers for Ks, t-free graphs: topological obstructions and algebraic constructions. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pablo De Caria The difference between clique graphs and iterated clique graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ruslan Sadykov, François Vanderbeck Column Generation for Extended Formulations. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1David Hartman, Dragan Masulovic Towards finite homomorphism-homogeneous relational structures. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matthew J. Samuel Abstract root systems and intervals in weak Bruhat order. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hervé Hocquard, Pascal Ochem, Petru Valicov Bounds and complexity results for strong edge colouring of subcubic graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Petr Gregor, Riste Skrekovski, Vida Vukasinovic On the queue-number of the hypercube. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro P. Montero Proper Hamiltonian Paths in Edge-Colored Multigraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma Rainbow Connection Number and Connected Dominating Sets. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Balázs Keszegh, Dömötör Pálvölgyi Octants are Cover Decomposable. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Anna S. Lladó Almost every tree with n edges decomposes K2n, 2n. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hernán Berinsky, Paula Zabala An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gary MacGillivray, André Raspaud, Jacobus Swarts Obstructions to Injective Oriented Colourings. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kazuyuki Amano On Extremal k-CNF Formulas. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arash Asadi, Luke Postle, Robin Thomas Minor-minimal non-projective planar graphs with an internal 3-separation. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma On the diameter of reconfiguration graphs for vertex colourings. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marcin Gasiorek, Daniel Simson Programming in PYTHON and an algorithmic description of positive wandering on one-peak posets. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler Clique-perfectness of complements of line graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gordana Manic, Daniel M. Martin, Milos Stojakovic Bichromatic Triangle Games. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Á. Carmona, Enrique Bendito, Andrés M. Encinas, Margarida Mitjana On the Moore-Penrose inverse of distance-regular graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Graham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth Permutation Capacities and Oriented Infinite Paths. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Csilla Bujtás, Zsolt Tuza Combinatorial batch codes: Extremal problems under Hall-type conditions. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2046 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.