|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 794 occurrences of 503 keywords
|
|
|
Results
Found 3106 publication records. Showing 3106 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
35 | Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(12), pp. 1279-1285, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
35 | Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 30, pp. 147-152, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Sonal Patel, Eric Harley |
Estimation of the number of cliques in a random graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C3S2E ![In: Canadian Conference on Computer Science & Software Engineering, C3S2E 2010, Montreal, Quebec, Canada, May 19-20, 2010, Proceedings, pp. 84-88, 2010, ACM, 978-1-60558-901-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
34 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Odd cycle packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 695-704, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
odd cycle, packing |
34 | Bruno Courcelle, Mamadou Moustapha Kanté |
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 66-75, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Oliver J. Woodford, Ian D. Reid 0001, Andrew W. Fitzgibbon |
Efficient new-view synthesis using pairwise dictionary priors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 18-23 June 2007, Minneapolis, Minnesota, USA, 2007, IEEE Computer Society, 1-4244-1179-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Jianyong Wang 0001, Zhiping Zeng, Lizhu Zhou |
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, pp. 73, 2006, IEEE Computer Society, 0-7695-2570-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Christophe Paul, Jan Arne Telle |
New Tools and Simpler Algorithms for Branchwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 379-390, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Serge Fenet, Christine Solnon |
Searching for Maximum Cliques with Ant Colony Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14-16, 2003, Proceedings, pp. 236-245, 2003, Springer, 3-540-00976-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Xiangang Cheng, Liang-Tien Chia |
Stratification-based keyframe cliques for removal of near-duplicates in video search results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multimedia Information Retrieval ![In: Proceedings of the 11th ACM SIGMM International Conference on Multimedia Information Retrieval, MIR 2010, Philadelphia, Pennsylvania, USA, March 29-31, 2010, pp. 313-322, 2010, ACM, 978-1-60558-815-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
quasi-clique, stratification-based, web video, near-duplicate |
32 | Natwar Modani, Kuntal Dey |
Large maximal cliques enumeration in sparse graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 1377-1378, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
filtering, maximal clique |
32 | Chunfang Zheng, Qian Zhu 0002, David Sankoff |
Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 4(4), pp. 515-522, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
rice, sorghum, synteny blocks, genome rearrangements, Maximum Weight Clique |
32 | Wilfried Steiner, Michael Paulitsch, Hermann Kopetz |
The TTA's Approach to Resilience after Transient Upsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 32(3), pp. 213-233, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
multiple failures, clique resolving, startup, self stabilization, recovery, Time-Triggered Architecture |
32 | Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov |
Novel Approaches for Analyzing Biological Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 10(1), pp. 23-39, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
n-cliques, n-clubs, clique relaxations, social networks, biological networks |
32 | Andreas Brandstädt |
On Robust Algorithms for the Maximum Weight Stable Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 445-458, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Maximum Weight Stable Set Problem on graphs, modules and homogeneous sets in graphs, graph structure, clique width, robust algorithms, prime graphs |
32 | Jayaram Bhasker, Tariq Samad |
Compacting MIMOLA microcode. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICRO ![In: Proceedings of the 20st Annual Workshop and Symposium on Microprogramming and Microarchitecture, 1987, Colorado Springs, Colorado, USA, December 1-4, 1987, pp. 97-105, 1987, ACM/IEEE, 0-89791-250-0. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
clique partitioning, synthesis, compaction, microprogramming |
30 | Katarzyna Musial, Krzysztof Juszczyszyn |
Properties of Bridge Nodes in Social Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCI ![In: Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems, First International Conference, ICCCI 2009, Wroclaw, Poland, October 5-7, 2009. Proceedings, pp. 357-364, 2009, Springer, 978-3-642-04440-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bridging node, regular clique, peripheral node, peripheral clique, social position |
28 | Ziyu Chen, Zhongshi He, Cheng Zhang |
The non-clique particle swarm optimizer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GEC Summit ![In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC Summit 2009, Shanghai, China, June 12-14, 2009, pp. 61-66, 2009, ACM, 978-1-60558-326-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
neighborhood topology, graph theory, particle swarm optimization |
28 | Lorenz Minder, Dan Vilenchik |
Small Clique Detection and Approximate Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 673-685, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Jürgen Herzog, Satoshi Murai, Xinxian Zheng, Takayuki Hibi, Ngô Viêt Trung |
Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(3), pp. 315-323, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05D05, 05C69 |
28 | Parthasarathy Guturu, Ram Dantu |
An Impatient Evolutionary Algorithm With Probabilistic Tabu Search for Unified Solution of Some NP-Hard Problems in Graph and Set Theory via Clique Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part B ![In: IEEE Trans. Syst. Man Cybern. Part B 38(3), pp. 645-666, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Deniss Kumlander |
On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes. ![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. 165-174, 2008, Springer, 978-3-540-87476-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Patryk Mazurkiewicz, Kin K. Leung |
Clique-Based Location Estimations for Wireless Sensors in GPS-Free Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 17th International Conference on Computer Communications and Networks, IEEE ICCCN 2008, St. Thomas, U.S. Virgin Islands, August 3-7, 2008, pp. 203-208, 2008, IEEE, 978-1-4244-2390-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Lixin Gan, Shengqian Wang, Mingwen Wang, Zhihua Xie, Lin Zhang, Zhenghua Shu |
Query Expansion based on Concept Clique for Markov Network Information Retrieval Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (5) ![In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 5, pp. 29-33, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Jan Obdrzálek |
Clique-Width and Parity Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 54-68, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin |
Computing Graph Polynomials on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 191-204, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Benjamin E. Birnbaum, Kenneth J. Goldman |
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 49-60, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Jianbo Li, Mingxia Chen, Jianping Li 0007, Weidong Li 0002 |
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 459-468, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithm, Interval graph, cliques |
28 | Qingfu Zhang 0001, Jianyong Sun, Edward P. K. Tsang |
An evolutionary algorithm with guided mutation for the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Evol. Comput. ![In: IEEE Trans. Evol. Comput. 9(2), pp. 192-200, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Ben Green 0001 |
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(3), pp. 307-326, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 11B75 |
28 | Feodor F. Dragan, Chenyu Yan |
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 583-592, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Andreas Brandstädt, Chính T. Hoàng |
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings, pp. 265-275, 2005, Springer, 3-540-26199-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Frank Gurski, Egon Wanke |
Vertex Disjoint Paths on Clique-Width Bounded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 119-128, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Etsuji Tomita, Tomokazu Seki |
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings, pp. 278-289, 2003, Springer, 3-540-40505-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Bruno Richard 0002, Donal Mac Nioclais, Denis Chalon |
Clique: A Transparent, Peer-to-Peer Replicated File System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mobile Data Management ![In: Mobile Data Management, 4th International Conference, MDM 2003, Melbourne, Australia, January 21-24, 2003, Proceedings, pp. 351-355, 2003, Springer, 3-540-00393-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Raffaele Mosca |
A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(3), pp. 517-528, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Lars Engebretsen, Jonas Holmerin |
Clique Is Hard to Approximate within n1-o(1). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 2-12, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Frank Gurski, Egon Wanke |
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 196-205, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Arun Jagota, Marcello Pelillo, Anand Rangarajan 0001 |
A New Deterministic Annealing Algorithm for Maximum Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN (6) ![In: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks, IJCNN 2000, Neural Computing: New Challenges and Perspectives for the New Millennium, Como, Italy, July 24-27, 2000, Volume 6, pp. 505-508, 2000, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Antonella Branca, Ettore Stella, Arcangelo Distante |
Feature Matching by Searching Maximum Clique on High Order Association Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: 1oth International Conference on Image Analysis and Processing (ICIAP 1999), 27-29 September 1999, Venice, Italy, pp. 642-658, 1999, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Joshua Alspector, Aleksander Kolcz, Nachimuthu Karunanithi |
Feature-based and Clique-based User Models for Movie Selection: A Comparative Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
User Model. User Adapt. Interact. ![In: User Model. User Adapt. Interact. 7(4), pp. 279-304, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
neural networks, feature extraction, collaborative filtering, User modeling, information filtering, bagging, linear models, CART, regression trees |
28 | Robert D. Carr |
Separating Clique Tree and Bipartition Inequalities in Polynominal Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 40-49, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
28 | Ingo Wegener |
On the complexity of branching programs and decision trees for clique functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 35(2), pp. 461-471, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Ingo Wegener |
On the Complexity of Branching Programs and Decision Trees for Clique Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'87), pp. 1-12, 1987, Springer, 3-540-17660-8. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
27 | Fatih Özgül, Zeki Erdem, Chris Bowerman, Claus Atzenbeck |
Comparison of Feature-Based Criminal Network Detection Models with k-Core and n-Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASONAM ![In: International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2010, Odense, Denmark, August 9-11, 2010, pp. 400-401, 2010, IEEE Computer Society, 978-0-7695-4138-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
criminal networks, k-core, n-clique, detection |
27 | Marcello Pelillo |
Heuristics for Maximum Clique and Independent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 1508-1520, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Algorithms, Heuristics, Independent set, Clique |
27 | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
Data reduction and exact algorithms for clique cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Clique cover, data reduction, fixed-parameter tractability |
27 | Zhiping Zeng, Jianyong Wang 0001, Lizhu Zhou, George Karypis |
Out-of-core coherent closed quasi-clique mining from large dense graph databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 32(2), pp. 13, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
coherent subgraph, frequent closed subgraph, quasi-clique, Graph mining, out-of-core algorithm |
27 | Daniel P. Fasulo, Anne-Katrin Emde, Lu-Yong Wang, Karin Noy, Nathan Edwards |
Alignment of Mass Spectrometry Data by Clique Finding and Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Systems Biology and Computational Proteomics ![In: Systems Biology and Computational Proteomics, Joint RECOMB 2006 Satellite Workshops on Systems Biology and on Computational Proteomics, San Diego, CA, USA, December 1-3, 2006, Revised Selected Papers, pp. 119-129, 2006, Springer, 978-3-540-73059-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded error model, clique finding, alignment, mass spectrometry |
27 | Aravind Srinivasan |
The value of strong inapproximability results for clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pp. 144-152, 2000, ACM, 1-58113-184-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
P vs. NP, inapproximabilit, packing integer programs, approximation algorithms, random sampling, independent set, clique |
27 | Elena Marchiori |
A simple heuristic based genetic algorithm for the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1998 ACM symposium on Applied Computing, SAC'98, Atlanta, GA, USA, February 27 - March 1, 1998, pp. 366-373, 1998, ACM, 0-89791-969-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
genetic algorithm, combinatorial optimization, heuristic algorithm, maximum clique problem |
27 | Johan Håstad |
Clique is Hard to Approximate Within n1-epsilon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 627-636, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Max Clique approximation, amortized free bits, global function, local functions, local consistency conditions, computational complexity, polynomial time, proof system |
27 | Uriel Feige, Shafi Goldwasser, László Lovász 0001, Shmuel Safra, Mario Szegedy |
Approximating Clique is Almost NP-Complete (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 2-12, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
approximation procedures, approximating clique, almost NP-complete, computational complexity, graph |
25 | Kazumi Saito, Takeshi Yamada, Kazuhiro Kazama |
The k-Dense Method to Extract Communities from Complex Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mining Complex Data ![In: Mining Complex Data, pp. 243-257, 2009, Springer, 978-3-540-88066-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Elad Hazan, Robert Krauthgamer |
How hard is it to approximate the best Nash equilibrium? ![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. 720-727, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | N. S. Narayanaswamy, R. Subhash Babu |
A Note on First-Fit Coloring of Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 25(1), pp. 49-53, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
First fit for online graph coloring, Column construction method, Competitive analysis |
25 | Michael ten Caat, Natasha M. Maurits, Jos B. T. M. Roerdink |
Data-Driven Visualization and Group Analysis of Multichannel EEG Coherence with Functional Units. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 14(4), pp. 756-771, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Jia Zeng, Zhi-Qiang Liu |
Type-2 Fuzzy Markov Random Fields and Their Application to Handwritten Chinese Character Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Fuzzy Syst. ![In: IEEE Trans. Fuzzy Syst. 16(3), pp. 747-760, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Andrea Asperti |
The intensional content of Rice's theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pp. 113-119, 2008, ACM, 978-1-59593-689-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
complexity, computability, recursion theory |
25 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, Frances A. Rosamond |
Clustering with Partial Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 144-155, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Yuzhou Zhang, Jianyong Wang 0001, Zhiping Zeng, Lizhu Zhou |
Parallel mining of closed quasi-cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, pp. 1-10, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Dongjoe Shin, Tardi Tjahjadi |
Similarity Invariant Delaunay Graph Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR & SPR 2008, Orlando, USA, December 4-6, 2008. Proceedings, pp. 25-34, 2008, Springer, 978-3-540-89688-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Delaunay tessellation, Similarity invariant distance, Hausdorff distance, Point pattern matching |
25 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT using vertex covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 44(7-8), pp. 509-523, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Takeaki Uno |
An Efficient Algorithm for Enumerating Pseudo Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 402-414, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Bruno Courcelle, Andrew Twigg |
Compact Forbidden-Set Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 37-48, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Algorithms, compact routing, labelling schemes |
25 | Bin Wu 0001, Xin Pei |
A Parallel Algorithm for Enumerating All the Maximal k -Plexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD Workshops ![In: Emerging Technologies in Knowledge Discovery and Data Mining, PAKDD 2007, International Workshops, Nanjing, China, May 22-25, 2007, Revised Selected Papers, pp. 476-483, 2007, Springer, 978-3-540-77016-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Shishir Nagaraja, Ross J. Anderson |
Dynamic Topologies for Robust Scale-Free Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIOWIRE ![In: Bio-Inspired Computing and Communication, First Workshop on Bio-Inspired Design of Networks, BIOWIRE 2007, Cambridge, UK, April 2-5, 2007, Revised Selected Papers, pp. 411-426, 2007, Springer, 978-3-540-92190-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
covert groups, security, robustness, topology, Scale-free networks |
25 | Arnaud Pêcher, Annegret Wagler |
Almost all webs are not rank-perfect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 311-328, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Rank-perfect graph, Stable set polytope, (Non-)rank facet, Web |
25 | Jorge A. Navas, Francisco Bueno, Manuel V. Hermenegildo |
Efficient Top-Down Set-Sharing Analysis Using Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages, 8th International Symposium, PADL 2006, Charleston, SC, USA, January 9-10, 2006, Proceedings, pp. 183-198, 2006, Springer, 3-540-30947-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Kazumi Saito, Takeshi Yamada |
Extracting Communities from Complex Networks by the k-dense Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 300-304, 2006, IEEE Computer Society, 0-7695-2702-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT Using Vertex Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 396-409, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Aili Han, Daming Zhu |
Complexity Analysis for the HEWN Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISDA (1) ![In: Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006), October 16-18, 2006, Jinan, China, pp. 1015-1019, 2006, IEEE Computer Society, 0-7695-2528-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Hongqiang Zhai, Yuguang Fang |
Impact of Routing Metrics on Path Capacity in Multirate and Multihop Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Proceedings of the 14th IEEE International Conference on Network Protocols, ICNP 2006, November 12-15, 2006, Santa Barbara, California, USA, pp. 86-95, 2006, IEEE Computer Society, 1-4244-0593-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Rakesh Agrawal 0001, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan |
Automatic Subspace Clustering of High Dimensional Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 11(1), pp. 5-33, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
clustering, dimensionality reduction, subspace clustering |
25 | Hailong Yao, Yici Cai, Qiang Zhou 0001, Xianlong Hong |
Crosstalk-Aware Routing Resource Assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(2), pp. 231-236, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
track/layer assignment, routing, VLSI, interconnect, physical design, crosstalk |
25 | Frank Gurski, Egon Wanke |
Minimizing NLC-Width is NP-Complete. ![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. 69-80, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Andrew R. Willis, Jasper Speicher, David B. Cooper |
Surface Sculpting with Stochastic Deformable 3D Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (2) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 249-252, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Benny Chor, Mike Fellows, David W. Juedes |
Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 257-269, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
Linear FPT reductions and computational lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 212-221, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
lower bound, complexity theory, NP-hard problems |
25 | Sing-Hoi Sze, Songjian Lu, Jianer Chen |
Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, Proceedings, pp. 438-449, 2004, Springer, 3-540-23018-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Raffaele Mosca |
A Shy Invariant of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(2), pp. 367-379, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Adrian Dumitrescu, Géza Tóth 0001 |
Ramsey-Type Results for Unions of Comparability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(2), pp. 245-251, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Ahmed Bouajjani, Agathe Merceron |
Parametric Verification of a Group Membership Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTRTFT ![In: Formal Techniques in Real-Time and Fault-Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings, pp. 311-330, 2002, Springer, 3-540-44165-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
parametric counter automata, Formal verification, abstraction, fault-tolerant protocols |
25 | Roberto Montemanni, D. H. Smith, Stuart M. Allen |
Lower Bounds for Fixed Spectrum Frequency Assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 107(1-4), pp. 237-250, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
radio frequency assignment, fixed spectrum problems, lower bounds |
25 | Vijay Raghavan 0002, Jeremy P. Spinrad |
Robust algorithms for restricted domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 460-467, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
25 | Shawn Grant, Gordon I. McCalla |
A Hybrid Approach to Making Recommendations and Its Application to the Movie Domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 14th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI 2001, Ottawa, Canada, June 7-9, 2001, Proceedings, pp. 257-266, 2001, Springer, 3-540-42144-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Danny van Noort, Frank-Ulrich Gast, John S. McCaskill |
DNA Computing in Microreactors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 7th International Workshop on DNA-Based Computers, DNA7, Tampa, Florida, USA, June 10-13, 2001, Revised Papers, pp. 33-45, 2001, Springer, 3-540-43775-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Albert Atserias, Nicola Galesi, Ricard Gavaldà |
Monotone Proofs of the Pigeon Hole Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 151-162, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Tomás Feder, Pavol Hell, Jing Huang 0007 |
List Homomorphisms and Circular Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(4), pp. 487-505, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C85, 68R10, 05C15, 05C75 |
25 | Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker |
Attributed Tree Matching and Maximum Weight Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: 1oth International Conference on Image Analysis and Processing (ICIAP 1999), 27-29 September 1999, Venice, Italy, pp. 1154-1159, 1999, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Rakesh Agrawal 0001, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan |
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA., pp. 94-105, 1998, ACM Press, 0-89791-995-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | D. L. Springer, Donald E. Thomas |
Exploiting the special structure of conflict and compatibility graphs in high-level synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(7), pp. 843-856, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Feodor F. Dragan, Andreas Brandstädt |
Dominating Cliques in Graphs with Hypertree Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 735-746, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Angelika Zobel |
Program structure as basis for parallelizing global register allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCL ![In: ICCL'92, Proceedings of the 1992 International Conference on Computer Languages, Oakland, California, USA, 20-23 Apr 1992, pp. 262-271, 1992, IEEE Computer Society, 0-8186-2585-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
25 | Lin Chen 0001 |
Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 383-394, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
24 | James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu |
Finding maximal cliques in massive networks by H*-graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010, pp. 447-458, 2010, ACM, 978-1-4503-0032-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
h*-graph, massive networks, maximal clique enumeration, scale-free networks, h-index |
24 | Samuel Rota Bulò, Marcello Pelillo |
A generalization of the Motzkin-Straus theorem to hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(2), pp. 287-295, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Polynomial optimization, Hypergraphs, Maximum clique |
24 | Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Rizzo |
Parallel shared memory strategies for ant-based optimization algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 1-8, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Max Clique, ant-based algorithms, MPI, shared memory, OpenMP, distributed memory |
24 | Deyong Hu, Bin Wu 0001, Qi Ye, Bai Wang 0001 |
Structure Correlation in Mobile Call Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, 5th International Conference, ADMA 2009, Beijing, China, August 17-19, 2009. Proceedings, pp. 479-486, 2009, Springer, 978-3-642-03347-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Clique Size Vector, Visualization, Social Network, Correlation, Anomaly, Structural Property |
24 | Louis Ibarra |
Fully dynamic algorithms for chordal graphs and split graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(4), pp. 40:1-40:20, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
clique trees, split graphs, chordal graphs, Dynamic graph algorithms |
Displaying result #101 - #200 of 3106 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|