Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("68R10")

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

Author Country

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

Results 1 to 25 of 3628

  • Page / 146
Export

Selection :

  • and

Multi-tilde-bar expressions and their automataCARON, Pascal; CHAMPARNAUD, Jean-Marc; MIGNOT, Ludovic et al.Acta informatica. 2012, Vol 49, Num 6, pp 413-436, issn 0001-5903, 24 p.Article

Classification of the (0,2)-graphs of valency 8BROUWER, Andries E; OSTERGARD, Patric R. J.Discrete mathematics. 2009, Vol 309, Num 3, pp 532-547, issn 0012-365X, 16 p.Conference Paper

A note on shellability and acyclic orientationsHACHIMORI, Masahiro; MORIYAMA, Sonoko.Discrete mathematics. 2008, Vol 308, Num 12, pp 2379-2381, issn 0012-365X, 3 p.Article

Labeling schemes for flow and connectivityKATZ, Michal; KATZ, Nir A; KORMAN, Amos et al.SIAM journal on computing (Print). 2005, Vol 34, Num 1, pp 23-40, issn 0097-5397, 18 p.Article

TRANSFORMING TRIANGULATIONS ON NONPLANAR SURFACESCORTES, C; CRIMA, C. I; HURTADO, F et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 821-840, issn 0895-4801, 20 p.Article

FINDING PATHS AND CYCLES OF SUPERPOLYLOGARITHMIC LENGTHGABOW, Harold N.SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1648-1671, issn 0097-5397, 24 p.Article

COMPUTING THE GIRTH OF A PLANAR GRAPH IN O(nlogn) TIMEWEIMANN, Oren; YUSTER, Raphael.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 609-616, issn 0895-4801, 8 p.Article

EXACT ALGORITHMS FOR TREEWIDTH AND MINIMUM FILL-INFOMIN, Fedor V; KRATSCH, Dieter; TODINCA, Ioan et al.SIAM journal on computing (Print). 2009, Vol 38, Num 3, pp 1058-1079, issn 0097-5397, 22 p.Article

A characterization of hypercactiSONNTAG, Martin.Discrete mathematics. 2007, Vol 307, Num 21, pp 2615-2621, issn 0012-365X, 7 p.Article

Powerful alliances in graphsBRIGHAM, Robert C; DUTTON, Ronald D; HAYNES, Teresa W et al.Discrete mathematics. 2009, Vol 309, Num 8, pp 2140-2147, issn 0012-365X, 8 p.Article

HARDNESS OF THE UNDIRECTED CONGESTION MINIMIZATION PROBLEMANDREWS, Matthew; ZHANG, Lisa.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 112-131, issn 0097-5397, 20 p.Article

Roman dominating influence parametersRUBALCABA, Robert R; SLATER, Peter J.Discrete mathematics. 2007, Vol 307, Num 24, pp 3194-3200, issn 0012-365X, 7 p.Article

Construction of a family of graphs with a small induced proper subgraph with minimum degree 3CHOI, Sul-Young; PUHUA GUAN.Discrete mathematics. 2007, Vol 307, Num 16, pp 1999-2001, issn 0012-365X, 3 p.Article

Complete r-partite subgraphs of dense r-graphsNIKIFOROV, Vladimir.Discrete mathematics. 2009, Vol 309, Num 13, pp 4326-4331, issn 0012-365X, 6 p.Article

SPANNERS OF COMPLETE k-PARTITE GEOMETRIC GRAPHSBOSE, Prosenjit; CARMI, Paz; COUTURE, Mathieu et al.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 1803-1820, issn 0097-5397, 18 p.Article

Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorableYINGQIAN WANG; MING CHEN; LIANG SHEN et al.Discrete mathematics. 2008, Vol 308, Num 17, pp 4014-4017, issn 0012-365X, 4 p.Article

Graphs with cyclomatic number two having panconnected squareCHIA, G. L; HEMAKUL, W; SINGHUN, S et al.Discrete mathematics. 2011, Vol 311, Num 10-11, pp 850-855, issn 0012-365X, 6 p.Article

On a graph's security numberDUTTON, Ronald D.Discrete mathematics. 2009, Vol 309, Num 13, pp 4443-4447, issn 0012-365X, 5 p.Article

A note on degree-constrained subgraphsFRANK, Andras; LAP CHI LAU; SZABO, Jacint et al.Discrete mathematics. 2008, Vol 308, Num 12, pp 2647-2648, issn 0012-365X, 2 p.Article

Toughness and the existence of fractional k-factors of graphsGUIZHEN LIU; LANJU ZHANG.Discrete mathematics. 2008, Vol 308, Num 9, pp 1741-1748, issn 0012-365X, 8 p.Article

On generalized θ-graphs whose second largest eigenvalue does not exceed 1MINGFEI GAO; QIONGXIANG HUANG.Discrete mathematics. 2008, Vol 308, Num 23, pp 5849-5855, issn 0012-365X, 7 p.Article

Degree sum and nowhere-zero 3-flowsGENGHUA FAN; CHUIXIANG ZHOU.Discrete mathematics. 2008, Vol 308, Num 24, pp 6233-6240, issn 0012-365X, 8 p.Article

Optimal 1-planar graphs which triangulate other surfacesSUZUKI, Yusuke.Discrete mathematics. 2010, Vol 310, Num 1, pp 6-11, issn 0012-365X, 6 p.Article

Rubbling and optimal rubbling of graphsBELFORD, Christopher; SIEBEN, Nandor.Discrete mathematics. 2009, Vol 309, Num 10, pp 3436-3446, issn 0012-365X, 11 p.Article

On the order of ({r, m}; g)-cages of even girthARAUJO-PARDO, G; BALBUENA, C; GARCAI-VAZQUEZ, P et al.Discrete mathematics. 2008, Vol 308, Num 12, pp 2484-2491, issn 0012-365X, 8 p.Article

  • Page / 146