Pascal and Francis Bibliographic Databases

Help

Search results

Your search

cc.\*:("001D02A06")

Filter

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

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 10731

  • Page / 430

Export

Selection :

  • and

Efficient subgraph matching using topological node feature constraintsDAHM, Nicholas; BUNKE, Horst; CAELLI, Terry et al.Pattern recognition. 2015, Vol 48, Num 2, pp 317-330, issn 0031-3203, 14 p.Conference Paper

Counting or Producing All Fixed Cardinality TransversalsWILD, Marcel.Algorithmica. 2014, Vol 69, Num 1, pp 117-129, issn 0178-4617, 13 p.Article

Lukasiewicz-based merging possibilistic networksTITOUNA, Faiza; BENFERHAT, Salem.International journal of approximate reasoning. 2014, Vol 55, Num 8, pp 1747-1763, issn 0888-613X, 17 p.Article

Asymptotic spectral distributions of Manhattan products of Cn#PmYUANBAO KANG; CAISHI WANG.Quantum information processing (Print). 2014, Vol 13, Num 11, pp 2499-2511, issn 1570-0755, 13 p.Article

Solutions to Conjectures on the (k, ℓ)-Rainbow Index of Complete GraphsQINGQIONG CAI; XUELIANG LI; JIANGLI SONG et al.Networks (New York, NY). 2013, Vol 62, Num 3, pp 220-224, issn 0028-3045, 5 p.Article

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs : New Trends in Algorithms and Theory of ComputationKIYOMI, Masashi; SAITOH, Toshiki; UEHARA, Ryuhei et al.IEICE transactions on information and systems. 2013, Vol 96, Num 3, pp 426-432, issn 0916-8532, 7 p.Article

Detecting community structure in bipartite networks based on matrix factorisationCHEN, Bo-Lun; LING CHEN; ZOU, Sheng-Rong et al.International journal of wireless and mobile computing (Print). 2013, Vol 6, Num 6, pp 599-607, issn 1741-1084, 9 p.Article

Energy distribution view for monotonic dual decompositionQIANG CHENG; FENG CHEN; JIANWU DONG et al.International journal of approximate reasoning. 2013, Vol 54, Num 9, pp 1279-1299, issn 0888-613X, 21 p.Article

Measuring degree-dependent failure in scale-free networks of bipartite structureYILUN SHANG.International journal of simulation & process modelling (Print). 2013, Vol 8, Num 1, pp 74-78, issn 1740-2123, 5 p.Article

Obtaining a Planar Graph by Vertex DeletionMARX, Dániel; SCHLOTTER, Ildikó.Algorithmica. 2012, Vol 62, Num 3-4, pp 807-822, issn 0178-4617, 16 p.Article

Minimum statuses of connected graphs with fixed maximum degree and orderCHIANG LIN; TSAI, Wei-Han; SHANG, Jen-Ling et al.Journal of combinatorial optimization. 2012, Vol 24, Num 3, pp 147-161, issn 1382-6905, 15 p.Article

On cyclic vertex-connectivity of Cartesian product digraphsDA HUANG; ZHAO ZHANG.Journal of combinatorial optimization. 2012, Vol 24, Num 3, pp 379-388, issn 1382-6905, 10 p.Article

Fifth European Workshop on Probabilistic Graphical Models (PGM-2010)ROOS, Teemu; MYLLYMÄKI, Petri; JAAKKOLA, Tommi et al.International journal of approximate reasoning. 2012, Vol 53, Num 9, issn 0888-613X, 127 p.Serial Issue

All roads lead to Rome—New search methods for the optimal triangulation problemOTTOSEN, Thorsten J; VOMLEL, Jiří.International journal of approximate reasoning. 2012, Vol 53, Num 9, pp 1350-1366, issn 0888-613X, 17 p.Article

A characterization of graphs with disjoint dominating and paired-dominating setsSOUTHEY, Justin; HENNING, Michael A.Journal of combinatorial optimization. 2011, Vol 22, Num 2, pp 217-234, issn 1382-6905, 18 p.Article

Automated Assembly of Shredded Pieces From Multiple PhotosHAIRONG LIU; SHENGJIAO CAO; SHUICHENG YAN et al.IEEE transactions on multimedia. 2011, Vol 13, Num 5, pp 1154-1162, issn 1520-9210, 9 p.Article

Finding a Minimum-depth Embedding of a Planar Graph in O(n4) TimeANGELINI, Patrizio; DI BATTISTA, Giuseppe; PATRIGNANI, Maurizio et al.Algorithmica. 2011, Vol 60, Num 4, pp 890-937, issn 0178-4617, 48 p.Article

Graph Characterization via Ihara CoefficientsPENG REN; WILSON, Richard C; HANCOCK, Edwin R et al.IEEE transactions on neural networks. 2011, Vol 22, Num 2, pp 233-245, issn 1045-9227, 13 p.Article

Super cyclically edge connected transitive graphsZHAO ZHANG; BING WANG.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 549-562, issn 1382-6905, 14 p.Article

The Connected Hub Number and the Connected Domination NumberJOHNSON, Peter; SLATER, Peter; WALSH, Matt et al.Networks (New York, NY). 2011, Vol 58, Num 3, pp 232-237, issn 0028-3045, 6 p.Article

k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning TreesEMEK, Yuval.Algorithmica. 2011, Vol 61, Num 1, pp 141-160, issn 0178-4617, 20 p.Article

Conférence MARAMI 2010 (Modèles et Analyse des Réseaux : Approches Mathématiques et Informatique)BOULET, Romain; THIRIOT, Samuel.Information interaction intelligence. 2011, Vol 11, Num 1, issn 1630-649X, 143 p.Conference Proceedings

A Model-Driven Development Approach for Modeling Business Transactions at the Computation Independent Model LevelBOCANEGRA, Jose; CASTANO, Diego.Software engineering research & preactice. International conferenceWorldComp'2011. 2011, pp 280-285, isbn 1-60132-199-6 1-60132-200-3 1-60132-201-1, 6 p.Conference Paper

A Deterministic Approximation Algorithm for Maximum 2-Path Packing : Foundations of Computer ScienceTANAHASHI, Ruka; CHEN, Zhi-Zhong.IEICE transactions on information and systems. 2010, Vol 93, Num 2, pp 241-249, issn 0916-8532, 9 p.Article

Partial duality and Bollobás and Riordan's ribbon graph polynomialMOFFATT, Lain.Discrete mathematics. 2010, Vol 310, Num 1, pp 174-183, issn 0012-365X, 10 p.Article

  • Page / 430