Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Combinatorial problem")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 4255

  • Page / 171

Export

Selection :

  • and

New bounds on the number of edges in a k-map graphCHEN, Zhi-Zhong.Lecture notes in computer science. 2004, pp 319-328, issn 0302-9743, isbn 3-540-22856-X, 10 p.Conference Paper

COCOON 2004 : computing and combinatorics (Jeju Island, 17-20 August 2004)Kyung-Yong Chwa; Munro, J. Ian.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22856-X, XIII, 474 p, isbn 3-540-22856-XConference Proceedings

COCOON 2005 : computing and combinatorics (Kunming, 16-29 August 2005)Wang, Lusheng.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28061-8, XVI, 995 p, isbn 3-540-28061-8Conference Proceedings

Generic algorithms for the generation of combinatorial objectsMARTINEZ, Conrado; MOLINERO, Xavier.Lecture notes in computer science. 2003, pp 572-581, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

On the selection and assignment with minimum quantity commitmentsLIM, Andrew; FAN WANG; ZHOU XU et al.Lecture notes in computer science. 2004, pp 102-111, issn 0302-9743, isbn 3-540-22856-X, 10 p.Conference Paper

Combinatoire des groupes à croissance polynomiale = Combinatorics on words of groups of polynomial growthIncitti, Roberto; Duchamp, G.1995, 71 p.Thesis

Medium worlds theories IPINHEIRO, M. R.Applied mathematics and computation. 2007, Vol 188, Num 2, pp 1061-1070, issn 0096-3003, 10 p.Article

CPM 2004 : combinatorial pattern matching (Istanbul, 5-7 July 2004)Sahinalp, Suleyman Cenk; Muthukrishnan, S; Dogrusoz, Ugur et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22341-X, XI, 486 p, isbn 3-540-22341-XConference Proceedings

k-center problems with minimum coverageLIM, Andrew; RODRIGUES, Brian; FAN WANG et al.Lecture notes in computer science. 2004, pp 349-359, issn 0302-9743, isbn 3-540-22856-X, 11 p.Conference Paper

On a geometric problem of zigzagsHALAVA, V; HARJU, T; ILIE, L et al.Information processing letters. 1997, Vol 62, Num 1, pp 1-4, issn 0020-0190Article

The combinatorics of authentication and secrecy codesSTINSON, D. R.Journal of cryptology. 1990, Vol 2, Num 1, pp 23-49, issn 0933-2790, 27 p.Article

Alternate strategies for solving bottleneck assignment problems, analysis and computational resultsDERIGS, U.Computing (Wien. Print). 1984, Vol 33, Num 2, pp 95-106, issn 0010-485XArticle

Probabilistic analysis of bin packing heuristicsHOON LIONG ONG; MAGAZINE, M. J; WEE, T. S et al.Operations research. 1984, Vol 32, Num 5, pp 983-998, issn 0030-364XArticle

Coding strings by pairs of stringsCHUNG, F. R. K; TARJAN, R. E; PAUL, W. J et al.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 3, pp 445-461, issn 0196-5212Article

A new formulation for the travelling salesman problemCLAUS, A.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 1, pp 21-25, issn 0196-5212Article

Algorithms for finding distance-edge-colorings of graphsITO, Takehiro; KATO, Akira; XIAO ZHOU et al.Lecture notes in computer science. 2005, pp 798-807, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

Angel, Devil, and KingKUTZ, Martin; POR, Attila.Lecture notes in computer science. 2005, pp 925-934, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

Large triangles in the d-dimensional unit-cube: (Extended abstract)LEFMANN, Hanno.Lecture notes in computer science. 2004, pp 43-52, issn 0302-9743, isbn 3-540-22856-X, 10 p.Conference Paper

Fault-tolerant meshes with constant degreeYAMADA, Toshinori.Lecture notes in computer science. 2004, pp 402-411, issn 0302-9743, isbn 3-540-22856-X, 10 p.Conference Paper

How to obtain the complete list of caterpillarsKIKUCHI, Yosuke; TANAKA, Hiroyuki; NAKANO, Shin-Ichi et al.Lecture notes in computer science. 2003, pp 329-338, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

On the half-half case of the Zarankiewicz problemGRIGGS, Jerrold R; HO, Chih-Chang.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 95-104, issn 0012-365XConference Paper

Genetic algorithms for large-scale clustering problemsFRÄNTI, P; KIVIJÄRVI, J; KAUKORANTA, T et al.Computer journal (Print). 1997, Vol 40, Num 9, pp 547-554, issn 0010-4620Article

On linear systems of equations with distinct variables and small block size : Proof of a combinatorial conjecture with applications to random feistel schemesPATARIN, Jacques.Lecture notes in computer science. 2006, pp 299-321, issn 0302-9743, isbn 3-540-33354-1, 1Vol, 23 p.Conference Paper

An upper bound on the number of rectangulations of a point setACKERMAN, Eyal; BAREQUET, Gill; PINTER, Ron Y et al.Lecture notes in computer science. 2005, pp 554-559, issn 0302-9743, isbn 3-540-28061-8, 6 p.Conference Paper

Reversal distance without hurdles and fortressesBERGERON, Anne; MIXTACKI, Julia; STOYE, Jens et al.Lecture notes in computer science. 2004, pp 388-399, issn 0302-9743, isbn 3-540-22341-X, 12 p.Conference Paper

  • Page / 171