Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
24 | Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
Independent Sets of Maximum Weight in Apple-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 848-858, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs |
24 | Andreas Brandstädt, Christian Hundt 0001 |
Ptolemaic Graphs and Interval Graphs Are Leaf Powers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 479-491, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers |
24 | Li Wan, Jianxin Liao, Xiaomin Zhu 0002 |
CDPM: Finding and Evaluating Community Structure in Social Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, 4th International Conference, ADMA 2008, Chengdu, China, October 8-10, 2008. Proceedings, pp. 620-627, 2008, Springer, 978-3-540-88191-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
community detection, clique, percolation |
24 | Adel M. Youssef, Mohamed F. Younis, Moustafa Youssef 0001, Ashok K. Agrawala |
On the accuracy of multi-hop relative location estimation in wireless sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2007, Honolulu, Hawaii, USA, August 12-16, 2007, pp. 481-486, 2007, ACM, 978-1-59593-695-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
CLIQUE factor, multi-hop localization, error analysis |
24 | Marc García-Arnau, Daniel Manrique, Alfonso Rodríguez-Patón, Petr Sosík |
Towards a Robust Biocomputing Solution of Intractable Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 13th International Meeting on DNA Computing, DNA13, Memphis, TN, USA, June 4-8, 2007, Revised Selected Papers, pp. 221-230, 2007, Springer, 978-3-540-77961-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Incremental Strategy, DNA Computing, NP-Complete problem, Membrane Computing, Maximum Clique Problem |
24 | Patric R. J. Östergård |
Two New Four-Error-Correcting Binary Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 36(3), pp. 327-329, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
error-correcting code, maximum clique problem |
24 | Stefanie Gerke, Colin McDiarmid |
Channel Assignment with Large Demands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 107(1-4), pp. 143-159, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
graph imperfection, clique-bounds, channel assignment |
24 | Yasuto Ishitani |
Flexible and Robust Model Matching based on Association Graph for Form Image Understanding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 3(2), pp. 104-119, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
Document image analysis, Subgraph isomorphism, Form processing, Model matching, Maximal clique, Association graph |
24 | Chung Ming Kuo, Chaur-Heh Hsieh, Yong Ren Huang, Zen Sun Lo |
A New Mesh-Based Temporal-Spatial Segmentation for Image Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 24th International Computer Software and Applications Conference (COMPSAC 2000), 25-28 October 2000, Taipei, Taiwan, pp. 395-400, 2000, IEEE Computer Society, 0-7695-0792-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Clique potential, Video segmentation, MAP, Video-object, Gibbs distribution |
24 | Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko |
. Efficient Parallel Algorithms on Distance-Hereditary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 1997 International Conference on Parallel Processing (ICPP '97), August 11-15, 1997, Bloomington, IL, USA, Proceedings, pp. 20-25, 1997, IEEE Computer Society, 0-8186-8108-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Steiner tree, PRAM, connected dominating set, clique, distance-hereditary graph |
24 | Yasuto Ishitani |
Model matching based on association graph for form image understanding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume I, pp. 287-292, 1995, IEEE Computer Society, 0-8186-7128-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
form image understanding, feature attributes, feature relationships, largest maximal clique, poor quality document images, feature extraction, graph theory, optical character recognition, document image processing, model matching, association graph |
24 | Levent Onural, M. Bilge Alp, Mehmet Izzet Gürelli |
Gibbs Random Field Model Based Weight Selection for the 2-D Adaptive Weighted Median Filter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(8), pp. 831-837, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Gibbs random field model based weight selection, 2-D adaptive weighted median filter, generalized filtering method, energy minimisation, 3/spl times/3 square neighborhood structure, clique energies, 3-pixel cliques, 2-pixel cliques, local statistics, filtering and prediction theory, adaptive filters, minimisation, linear filters, two-dimensional digital filters |
23 | Sarab Almuhaideb, Najwa Altwaijry, Shaha Al-Mansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran |
Clique Finder: A Self-Adaptive Simulated Annealing Algorithm for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Appl. Metaheuristic Comput. ![In: Int. J. Appl. Metaheuristic Comput. 13(2), pp. 1-22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Chuan-Min Lee |
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 14(1), pp. 22, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko |
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 32(3), pp. 747-762, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Ui-Hyeop Shin, Hyung-Min Park |
Auxiliary-Function-Based Independent Vector Analysis Using Generalized Inter-Clique Dependence Source Models With Clique Variance Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 8, pp. 68103-68113, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev |
Between clique-width and linear clique-width of bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(8), pp. 111926, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Hoang Dau, Olgica Milenkovic, Gregory J. Puleo |
On the triangle clique cover and Kt clique cover problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(1), pp. 111627, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Liliana Alcón, Sylvain Gravier, Cláudia Linhares Sales, Fábio Protti, Gabriela Ravenna |
On clique-inverse graphs of graphs with bounded clique number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 94(4), pp. 531-538, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Zuosong Liang, Erfang Shan, Liying Kang |
The clique-perfectness and clique-coloring of outer-planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 38(3), pp. 794-807, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Pedro Montealegre-Barba |
Sequential and distributes graph algorithms. Parameterized algorithms via potential maximal cliques; broadcast congested clique. (Algorithmes de graphes séquentiels et distribués. Algorithmes paramétrés via des cliques maximales potentielles ; Modèle de diffusion dans une clique congestionnée). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2017 |
RDF |
|
23 | Pablo De Caria, Miguel A. Pizaña |
On second iterated clique graphs that are also third iterated clique graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 50, pp. 319-324, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita |
Enumerating Maximal Clique Sets with Pseudo-Clique Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science - 18th International Conference, DS 2015, Banff, AB, Canada, October 4-6, 2015, Proceedings, pp. 324-339, 2015, Springer, 978-3-319-24281-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Erfang Shan, Zuosong Liang, Liying Kang |
Clique-transversal sets and clique-coloring in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 36, pp. 367-376, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Daniel Meister 0001, Udi Rotics |
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1306.2114, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Noriyoshi Sukegawa, Atsushi Miyauchi 0001 |
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 10(4), pp. 331-332, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Qinghua Wu 0002 |
The maximum clique problems with applications to graph coloring. (Problèmes de clique maximum avec applications à la coloration de graphe). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
23 | Pablo De Caria |
The difference between clique graphs and iterated clique graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 37, pp. 39-44, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Zuosong Liang, Erfang Shan |
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 111(23-24), pp. 1104-1107, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Pinar Heggernes, Daniel Meister 0001, Udi Rotics |
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings, pp. 233-246, 2011, Springer, 978-3-642-20711-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Raghavan Rama 0001, Suresh Badarla, Kamala Krithivasan |
Clique-Detection Algorithm Using Clique-Self-Assembly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIC-TA ![In: Sixth International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2011, Penang, Malaysia, September 27-29, 2011, pp. 225-230, 2011, IEEE Computer Society, 978-1-4577-1092-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Gek Ling Chia, Poh-Hwa Ong |
On self-clique graphs with given clique sizes, II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(6), pp. 1538-1547, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Francisco Larrión, Miguel A. Pizaña |
On hereditary clique-Helly self-clique graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(7), pp. 1157-1167, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Min Chih Lin, Jayme Luiz Szwarcfiter |
Faster recognition of clique-Helly and hereditary clique-Helly graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 103(1), pp. 40-43, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Xiaoyun Ji, John E. Mitchell 0001 |
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 4(1), pp. 87-102, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width II: non-approximability of clique-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
23 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
23 | Márcia R. Cerioli |
Clique Graphs and Edge-clique graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 13, pp. 34-37, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Venkatesan Guruswami, C. Pandu Rangan |
Algorithmic aspects of clique-transversal and clique-independent sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 100(3), pp. 183-202, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Gek Ling Chia |
On self-clique graphs with given clique sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 212(3), pp. 185-189, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Joan Climent, Antoni Grau, Alberto Sanfeliu |
Clique-to-Clique Distance Computation Using a Specific Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Advances in Pattern Recognition, Joint IAPR International Workshops SSPR '98 and SPR '98, Sydney, NSW, Australia, August 11-13, 1998, Proceedings, pp. 405-412, 1998, Springer, 3-540-64858-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 10(1), pp. 109-127, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | V. Balachandran, P. Nagavamsi, C. Pandu Rangan |
Clique Transversal and Clique Independence on Comparability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 58(4), pp. 181-184, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Zbigniew Lonc |
Clique packings and clique partitions of graphs without odd chordles cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 16(2), pp. 143-149, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Erich Prisner |
Clique Covering and Clique Partition in Generalizations of Line Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 56(1), pp. 93-98, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Sean McGuinness |
Restricted Greedy Clique Decompositions and Greedy Clique Decompositions of K4-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 14(3), pp. 321-334, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Sean McGuinness, Rolf S. Rees |
On the number of distinct minimal clique partitions and clique covers of a line graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 83(1), pp. 49-62, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Paul Erdös, Ralph J. Faudree, Edward T. Ordman |
Clique partitions and clique coverings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 72(1-3), pp. 93-101, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
20 | Anna Förster, Amy L. Murphy |
CLIQUE: Role-Free Clustering with Q-Learning for Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 22-26 June 2009, Montreal, Québec, Canada, pp. 441-449, 2009, IEEE Computer Society, 978-0-7695-3659-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Deniss Kumlander |
An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings, pp. 175-181, 2008, Springer, 978-3-540-87476-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Chris H. Q. Ding, Tao Li 0001, Michael I. Jordan |
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 183-192, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Pinar Heggernes, Daniel Meister 0001, Charis Papadopoulos |
Graphs of Linear Clique-Width at Most 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 330-341, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Pascal Koiran, Klaus Meer |
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 252-263, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Jianxin Wang 0001, Zhao Cai, Min Li 0007 |
An Improved Method Based on Maximal Clique for Predicting Interactions in Protein Interaction Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMEI (1) ![In: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, BMEI 2008, May 28-30, 2008, Sanya, Hainan, China - Volume 1, pp. 62-66, 2008, IEEE Computer Society, 978-0-7695-3118-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Alexandre P. Francisco, Ricardo Baeza-Yates, Arlindo L. Oliveira |
Clique Analysis of Query Log Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings, pp. 188-199, 2008, Springer, 978-3-540-89096-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Ghazi Al-Naymat |
Enumeration of maximal clique for mining spatial co-location patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: The 6th ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2008, Doha, Qatar, March 31 - April 4, 2008, pp. 126-133, 2008, IEEE Computer Society, 978-1-4244-1967-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Irène Charon, Olivier Hudry |
Application of the "descent with mutations" metaheuristic to a clique partitioning problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RIVF ![In: 2007 IEEE International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies, RIVF 2007, Hanoi, Vietnam, 5-9 March 2007, pp. 29-35, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Shuichi Watanabe, Junji Kitamichi, Kenichi Kuroda |
A Hardware Algorithm for the Minimum p-Quasi Clique Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPL ![In: FPL 2007, International Conference on Field Programmable Logic and Applications, Amsterdam, The Netherlands, 27-29 August 2007, pp. 139-144, 2007, IEEE, 1-4244-1060-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihisa |
Iterated k-Opt Local Search for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings, pp. 84-95, 2007, Springer, 978-3-540-71614-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Byung-Won On, Ergin Elmacioglu, Dongwon Lee 0001, Jaewoo Kang, Jian Pei |
An effective approach to entity resolution problem using quasi-clique and its application to digital libraries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDL ![In: ACM/IEEE Joint Conference on Digital Libraries, JCDL 2006, Chapel Hill, NC, USA, June 11-15, 2006, Proceedings, pp. 51-52, 2006, ACM, 1-59593-354-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph partition, name disambiguation, entity resolution |
20 | Song Xu, Lixin Shen, Jun Zhai, Zan Yang, Yongxian Li |
Research on Virtual Logistic Enterprises Partners Selection Method Based on CLIQUE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 10th International Conference on CSCW in Design, CSCWD 2006, May 3-5, 2006, Southeast University, Nanjing, China, pp. 1263-1267, 2006, IEEE, 1-4244-0165-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Tammy Toscos, Anne M. Faber, Shunying An, Mona Praful Gandhi |
Chick clique: persuasive technology to motivate teenage girls to exercise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI Extended Abstracts ![In: Extended Abstracts Proceedings of the 2006 Conference on Human Factors in Computing Systems, CHI 2006, Montréal, Québec, Canada, April 22-27, 2006, pp. 1873-1878, 2006, ACM, 978-1-59593-298-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
preventative applications, teenage obesity, persuasive technology, health informatics |
20 | Wei Gao 0001, Kam-Fai Wong, Yunqing Xia, Ruifeng Xu |
Clique Percolation Method for Finding Naturally Cohesive and Overlapping Document Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCPOL ![In: Computer Processing of Oriental Languages. Beyond the Orient: The Research Challenges Ahead, 21st International Conference, ICCPOL 2006, Singapore, December 17-19, 2006, Proceedings, pp. 97-108, 2006, Springer, 3-540-49667-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Wei Gao 0001, Kam-Fai Wong |
Natural Document Clustering by Clique Percolation in Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIRS ![In: Information Retrieval Technology, Third Asia Information Retrieval Symposium, AIRS 2006, Singapore, October 16-18, 2006, Proceedings, pp. 119-131, 2006, Springer, 3-540-45780-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Pascal Berthomé, Sylvain Lebresne, Kim Nguyen 0001 |
Computation of Chromatic Polynomials Using Triangulations and Clique Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 362-373, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Holger Blaar, Thomas Lange, Renate Winter, Marcel Karnstedt |
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), CD-ROM / Abstracts Proceedings, 4-8 April 2005, Denver, CO, USA, 2005, IEEE Computer Society, 0-7695-2312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Martin Marciniszyn, Reto Spöhel, Angelika Steger |
The Online Clique Avoidance Game on Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 390-401, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Subhash Khot |
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 136-145, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Jiahai Wang, Xinshun Xu, Zheng Tang, Weixing Bi, Xiaoming Chen, Yong Li 0003 |
A New Neural Network Algorithm for Clique Vertex-Partition Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2004, International Symposium on Neural Networks, Dalian, China, August 19-21, 2004, Proceedings, Part I, pp. 425-429, 2004, Springer, 3-540-22841-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Sherin M. Youssef, David G. Elliman |
Reactive Prohibition-Based Ant Colony Optimization (RPACO): A New Parallel Architecture for Constrained Clique Sub-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton, FL, USA, pp. 63-71, 2004, IEEE Computer Society, 0-7695-2236-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | John D. Lafferty, Xiaojin Zhu 0001, Yan Liu 0002 |
Kernel conditional random fields: representation and clique selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-first International Conference (ICML 2004), Banff, Alberta, Canada, July 4-8, 2004, 2004, ACM. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Ioan Todinca |
Coloring Powers of Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 370-382, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Narong Punnim |
The Clique Numbers of Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(4), pp. 781-785, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Rodica Boliac, Vadim V. Lozin |
On the Clique-Width of Graphs in Hereditary Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 44-54, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Brijnesh J. Jain, Fritz Wysotzki |
Fast Winner-Takes-All Networks for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KI ![In: KI 2002: Advances in Artificial Intelligence, 25th Annual German Conference on AI, KI 2002, Aachen, Germany, September 16-20, 2002, Proceedings, pp. 163-173, 2002, Springer, 3-540-44185-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Elena Marchiori |
Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings, pp. 112-121, 2002, Springer, 3-540-43432-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Takayuki Nagoya |
Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 136-147, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Georg Gottlob, Reinhard Pichler |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 708-719, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 117-128, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
Deciding Clique-Width for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pp. 87-98, 2001, Springer, 3-540-42423-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Kazuyuki Amano, Akira Maruoka |
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 399-408, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Marcello Pelillo, Immanuel M. Bomze |
Parallelizable Evolutionary Dynamics Principles for Solving the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN IV, International Conference on Evolutionary Computation. The 4th International Conference on Parallel Problem Solving from Nature, Berlin, Germany, September 22-26, 1996, Proceedings, pp. 676-685, 1996, Springer, 3-540-61723-X. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
17 | Nan Du, Bin Wu 0001, Liutong Xu, Bai Wang 0001, Pei Xin |
Parallel Algorithm for Enumerating Maximal Cliques in Complex Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mining Complex Data ![In: Mining Complex Data, pp. 207-221, 2009, Springer, 978-3-540-88066-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Benjamin Rossman |
Ehrenfeucht-Fraïssé Games on Random Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings, pp. 350-364, 2009, Springer, 978-3-642-02260-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 1183-1192, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
Colinear Coloring on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 117-128, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Colinear coloring, threshold graphs, quasi-threshold graphs, algorithms, complexity, chordal graphs, chromatic number |
17 | Loïc Cerf, Tran Bao Nhan Nguyen, Jean-François Boulicaut |
Discovering Relevant Cross-Graph Cliques in Dynamic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 18th International Symposium, ISMIS 2009, Prague, Czech Republic, September 14-17, 2009. Proceedings, pp. 513-522, 2009, Springer, 978-3-642-04124-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Zhongshan Lin, SeungJin Lim |
Optimal candidate generation in spatial co-location mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12, 2009, pp. 1441-1445, 2009, ACM, 978-1-60558-166-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
co-location mining, spatial data mining, cliqueness |
17 | Ikno Kim, Junzo Watada |
Searching Cliques in a Fuzzy Graph Based on an Evolutionary and Biological Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based and Intelligent Information and Engineering Systems, 13th International Conference, KES 2009, Santiago, Chile, September 28-30, 2009, Proceedings, Part II, pp. 166-173, 2009, Springer, 978-3-642-04591-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Aurélie Favier, Simon de Givry, Philippe Jégou |
Exploiting Problem Structure for Solution Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings, pp. 335-343, 2009, Springer, 978-3-642-04243-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Immanuel M. Bomze, Marco Locatelli 0001, Fabio Tardella |
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(1), pp. 31-64, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C20, 90C26 |
17 | Henryk Potrzebowski, Jaroslaw Tomasz Stanczak, Krzysztof Sep |
Separable Decomposition of Graph Using alpha- cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Recognition Systems 2 ![In: Computer Recognition Systems 2, pp. 386-393, 2008, Springer, 978-3-540-75174-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Tsung Teng Chen, Liang Chi Hsieh |
The Visualization of Relatedness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: 12th International Conference on Information Visualisation, IV 2008, 8-11 July 2008, London, UK, pp. 415-420, 2008, IEEE Computer Society, 978-0-7695-3268-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Chih-Pin Liao, Jen-Tzung Chien |
Graphical modeling of conditional random fields for human motion recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2008, March 30 - April 4, 2008, Caesars Palace, Las Vegas, Nevada, USA, pp. 1969-1972, 2008, IEEE, 1-4244-1484-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Yichuan Ding, Nathan Krislock, Jiawei Qian, Henry Wolkowicz |
Sensor network localization, euclidean distance matrix completions, and graph realization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MELT ![In: Proceedings of the ACM International Workshop on Mobile Entity Localization and Tracking in GPS-less Environments, MELT 2008, San Francisco, California, USA, September 19, 2008, pp. 129-134, 2008, ACM, 978-1-60558-189-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
euclidean distance matrix completions, graph realization, semidefinite programming, anchors, sensor network localization |
17 | Cheng-Fa Tsai, Chia-Chen Yen |
G-TREACLE: A New Grid-Based and Tree-Alike Pattern Clustering Technique for Large Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 12th Pacific-Asia Conference, PAKDD 2008, Osaka, Japan, May 20-23, 2008 Proceedings, pp. 739-748, 2008, Springer, 978-3-540-68124-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hybrid clustering algorithm, data mining, data clustering |
17 | Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee |
Toward Global Minimum through Combined Local Minima. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (4) ![In: Computer Vision - ECCV 2008, 10th European Conference on Computer Vision, Marseille, France, October 12-18, 2008, Proceedings, Part IV, pp. 298-311, 2008, Springer, 978-3-540-88692-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Andrzej Dudek, Vojtech Rödl |
New Upper Bound on Vertex Folkman Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 473-478, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
vertex Folkman numbers, Ramsey theory |
17 | Federico Malucelli, Sara Nicoloso |
Shiftable intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 150(1), pp. 137-157, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Complexity, Optimization problems, Interval graphs |
17 | Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan |
Improved algorithms for weakly chordal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(2), pp. 14, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
weakly chordal, graph algorithms, recognition, coloring, Perfect graphs |