|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 299 occurrences of 196 keywords
|
|
|
Results
Found 3049 publication records. Showing 3049 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
77 | Özgür Sümer |
Partial covering of hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 572-581, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
partial hypergraph cover, partial set cover, greedy algorithm |
73 | Matej Stehlík |
Minimal Connected tau-Critical Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(3), pp. 421-426, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
?-critical hypergraphs, Colour-critical graphs, t-stable hypergraphs |
66 | Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl |
Representation of Planar Hypergraphs by Contacts of Triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 125-136, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
65 | Klaus Barthelmann |
When Can an Equational Simple Graph Be Generated by Hyperedge Replacement? ![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. 543-552, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
64 | Hadas Shachnai, Aravind Srinivasan |
Finding large independent sets of hypergraphs in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pp. 163-168, 2001, ACM, 1-58113-409-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
parallel algorithms, randomized algorithms, hypergraphs, independent sets |
58 | Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege |
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
58 | Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege |
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
55 | Marek Karpinski, Andrzej Rucinski 0001, Edyta Szymanska |
The Complexity of Perfect Matching Problems on Dense Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 626-636, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
55 | Peng Ren 0001, Tatjana M. Aleksic, Richard C. Wilson 0001, Edwin R. Hancock |
Hypergraphs, Characteristic Polynomials and the Ihara Zeta Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAIP ![In: Computer Analysis of Images and Patterns, 13th International Conference, CAIP 2009, Münster, Germany, September 2-4, 2009. Proceedings, pp. 369-376, 2009, Springer, 978-3-642-03766-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
55 | Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Michel Neuhaus, Marc Stettler |
Matching of Hypergraphs - Algorithms, Applications, and Experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applied Pattern Recognition ![In: Applied Pattern Recognition, pp. 131-154, 2008, Springer, 978-3-540-76830-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hypergraph matching, graph, graph matching, hypergraph, Structural pattern recognition |
55 | Andrea Vietri |
Arc-Coloring of Directed Hypergraphs and Brick-Coloring of Walls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: 8th International Conference on Information Visualisation, IV 2004, 14-16 July 2004, London, UK, pp. 394-399, 2004, IEEE Computer Society, 0-7695-2177-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
arc-coloring, brick, chromatic index, directed hypergraph, wall |
55 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. ![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. 488-498, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Mohammad R. Salavatipour |
A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 347-356, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
55 | Michael Krivelevich, Benny Sudakov |
Approximate Coloring of Uniform Hypergraphs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 477-489, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
55 | Hui Chen, Alan M. Frieze |
Coloring Bipartite Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 345-358, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
55 | Domenico Saccà |
Closures of Database Hypergraphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(4), pp. 774-803, October 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
54 | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
A New Algorithm for the Hypergraph Transversal Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 767-776, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
53 | Vojtech Rödl, Mathias Schacht |
Property testing in hypergraphs and the removal lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 488-495, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hereditary properties, removal lemma, hypergraphs, property testing, regularity lemma |
47 | Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege (eds.) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
47 | Daniel Raible 0001, Henning Fernau |
Exact Elimination of Cycles in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
47 | Igor Razgon, Barry O'Sullivan |
Directed Feedback Vertex Set is Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
47 | Iris van Rooij, Matthew Hamilton, Moritz Müller, Todd Wareham |
Approximating Solution Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
47 | Jianer Chen, Yang Liu 0002, Songjian Lu |
Directed Feedback Vertex Set Problem is FPT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
44 | Kai Plociennik |
Approximating Independent Set and Coloring in Random Uniform Hypergraphs. ![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. 539-550, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Samuel Rota Bulò, Marcello Pelillo |
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LION ![In: Learning and Intelligent Optimization, Second International Conference, LION 2007, Trento, Italy, December 8-12, 2007. Selected Papers, pp. 220-233, 2007, Springer, 978-3-540-92694-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Gaurav Trivedi, H. Narayanan |
Application of Fast DC Analysis to Partitioning Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS ![In: International Symposium on Circuits and Systems (ISCAS 2007), 27-20 May 2007, New Orleans, Louisiana, USA, pp. 3407-3410, 2007, IEEE, 1-4244-0920-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Shakhar Smorodinsky |
On the chromatic number of some geometric hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 316-323, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
44 | Michael Langberg |
Testing the Independence Number of Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, pp. 405-416, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr. |
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 95(3), pp. 533-554, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Elias Dahlhaus |
Improved Efficient Parallel Algorithms to Recognize Interval Graphs and Interval Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (1) ![In: 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 7-10 January 1997, Maui, Hawaii, USA, pp. 172-181, 1997, IEEE Computer Society, 0-8186-7734-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
44 | David Maier 0001, Jeffrey D. Ullman |
Connections in Acyclic Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the ACM Symposium on Principles of Database Systems, March 29-31, 1982, Los Angeles, California, USA, pp. 34-39, 1982, ACM, 0-89791-070-2. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
44 | Alexander Mehler, Matthias Dehmer, Rüdiger Gleim |
Towards Logical Hypertext Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IICS ![In: Innovative Internet Community Systems, 4th InternationalWorkshop, IICS 2004, Guadalajara, Mexico, June 21-23, 2004, Revised Papers, pp. 136-150, 2004, Springer, 3-540-28880-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
44 | George Karypis, Rajat Aggarwal, Vipin Kumar 0001, Shashi Shekhar |
Multilevel hypergraph partitioning: applications in VLSI domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 7(1), pp. 69-79, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
44 | Bruno Courcelle |
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 90-91, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
44 | Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan |
Approximate Hypergraph Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings, pp. 41-52, 1996, Springer, 3-540-61422-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
44 | Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 65-80, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
42 | 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 |
42 | Boualem Benatallah, Mohand-Said Hacid, Christophe Rey, Farouk Toumani |
Request Rewriting-Based Web Service Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISWC ![In: The Semantic Web - ISWC 2003, Second International Semantic Web Conference, Sanibel Island, FL, USA, October 20-23, 2003, Proceedings, pp. 242-257, 2003, Springer, 3-540-20362-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Semantic Web Services, Description Logics, Hypergraphs, Web Services Discovery |
33 | Robert Berke, Mikael Onsjö |
Propagation Connectivity of Random Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 26-28, 2009. Proceedings, pp. 117-126, 2009, Springer, 978-3-642-04943-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Lei Ding 0002, Alper Yilmaz |
Image Segmentation as Learning on Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMLA ![In: Seventh International Conference on Machine Learning and Applications, ICMLA 2008, San Diego, California, USA, 11-13 December 2008, pp. 247-252, 2008, IEEE Computer Society, 978-0-7695-3495-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Mingyu Xiao 0001 |
Finding Minimum 3-Way Cuts in Hypergraphs. ![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. 270-281, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Michael Kaufmann 0001, Marc J. van Kreveld, Bettina Speckmann |
Subdivision Drawings of Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 396-407, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Michael Brinkmeier, Jeremias Werner, Sven Recknagel |
Communities in graphs and hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, November 6-10, 2007, pp. 869-872, 2007, ACM, 978-1-59593-803-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
cohesive group, community, image segmentation, components, graph, hypergraph, edge-connectivity, document collection |
33 | Arkadev Chattopadhyay, Bruce A. Reed |
Properly 2-Colouring Linear Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 395-408, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Hanno Lefmann |
Convex Hulls of Point-Sets and Non-uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings, pp. 285-295, 2007, Springer, 978-3-540-72868-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Hong Gao 0001, Frank K. Hwang, My T. Thai, Weili Wu 0001, Taieb Znati |
Construction of d(H)-disjunct matrix for group testing in hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 12(3), pp. 297-301, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
DNA library screening, Complex, Group testing, Pooling designs |
33 | Bruno Courcelle |
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, pp. 1-11, 2004, Springer, 3-540-24014-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Mayur Thakur, Rahul Tripathi |
Complexity of Linear Connectivity Problems in Directed Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, pp. 481-493, 2004, Springer, 3-540-24058-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | André E. Kézdy, Jenö Lehel, Robert C. Powers |
Heavy Transversals and Indecomposable Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(2), pp. 303-310, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05C65, 05C90, 05D15 |
33 | Andreas Huck, Eberhard Triesch |
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(3), pp. 409-416, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C65, 05C70 |
33 | Jonas Holmerin |
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 1005-1016, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | S. Chastel, Philippe Colantoni, Alain Bretto |
Displaying Image Neighborhood Hypergraphs Line-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 10th International Conference, DGCI 2002, Bordeaux, France, April 3-5, 2002, Proceedings, pp. 124-135, 2002, Springer, 3-540-43380-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss |
Complexity Note on Mixed Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 474-486, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Thomas Hofmeister, Hanno Lefmann |
Approximating Maximum Independent Sets in Uniform Hypergraphs. ![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. 562-570, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Paola Bonizzoni, Gianluca Della Vedova |
Modular Decomposition of Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings, pp. 303-317, 1995, Springer, 3-540-60618-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Paola Alimonti, Esteban Feuerstein |
Petri Nets, Hypergraphs and Conflicts (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings, pp. 293-309, 1992, Springer, 3-540-56402-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
33 | Jan Paredaens, Dirk Van Gucht |
An Application of the Theory of Graphs and Hypergraphs to the Decomposition of Relational Database Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings, pp. 350-366, 1983, Springer, 3-540-12727-5. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
33 | Dániel Marx |
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. ![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. 735-744, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability |
33 | Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht |
Hypergraph regularity and quasi-randomness. ![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. 227-235, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Georg Gottlob, Marko Samer |
A backtracking-based algorithm for hypertree decomposition. ![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 |
hypertree decomposition, Constraint satisfaction |
33 | Attila Bernáth, Tamás Király |
A New Approach to Splitting-Off. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 401-415, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige |
Minimum Transversals in Posi-modular Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 576-587, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Sameer Agarwal 0001, Kristin Branson, Serge J. Belongie |
Higher order learning with graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006, pp. 17-24, 2006, ACM, 1-59593-383-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | George Karypis, Rajat Aggarwal, Vipin Kumar 0001, Shashi Shekhar |
Multilevel Hypergraph Partitioning: Application in VLSI Domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 34st Conference on Design Automation, Anaheim, California, USA, Anaheim Convention Center, June 9-13, 1997., pp. 526-529, 1997, ACM Press, 0-89791-920-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | V. S. Lakshmanan 0001, N. Chandrasekharan, C. E. Veni Madhavan |
Recognition and Top-Down Generation of beta-Acyclic Database Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings, pp. 344-366, 1984, Springer, 3-540-13883-8. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
31 | Mysore Ramaswamy, Sumit Sarkar, Ye-Sho Chen |
Using Directed Hypergraphs to Verity Rule-Based Expert Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 9(2), pp. 221-237, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
knowledge verification, knowledge acquisition, Error detection, hypergraphs, rule-based expert systems |
31 | Andrew K. C. Wong, Si W. Lu, Marc Rioux |
Recognition and Shape Synthesis of 3-D Objects Based on Attributed Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(3), pp. 279-290, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
attributed hypergraphs, shape synthesis, graph monomorphism, Grinnell imaging system, computer vision, computer vision, graph theory, computerised pattern recognition, computerised pattern recognition, range data, 3D object recognition |
31 | Karima Toumani, Hélène Jaudoin, Michel Schneider |
Automatic Generation of P2P Mappings between Sources Schemas. ![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. 139-150, 2009, Springer, 978-3-642-04124-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
rewriting queries, description logics, hypergraphs, Schema mappings |
31 | Hanno Lefmann |
Point sets in the unit square and large areas of convex hulls of subsets of points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(2), pp. 182-195, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Heilbronn’s triangle problem, Approximation algorithm, Hypergraphs |
31 | Fabio Massacci, Artsiom Yautsiukhin |
An algorithm for the appraisal of assurance indicators for complex business processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QoP ![In: Proceedings of the 3th ACM Workshop on Quality of Protection, QoP 2007, Alexandria, VA, USA, October 29, 2007, pp. 22-27, 2007, ACM, 978-1-59593-885-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
assurance indicator, quality of protection, security indicator, business process, hypergraphs, security metrics |
31 | Georg Gottlob, Gianluigi Greco |
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007, pp. 152-161, 2007, ACM, 978-1-59593-653-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hypertree decompositions, combinatorial auctions, hypergraphs |
31 | Adrian-Horia Dediu, Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Benedek Nagy |
Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, pp. 327-338, 2006, Springer, 3-540-35428-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Contextual hypergraph grammars, contextual grammars, hyperedge replacement grammars, double-pushout hypergraph grammars, hypergraphs |
31 | Hassan H. Malik, John R. Kender |
Clustering web images using association rules, interestingness measures, and hypergraph partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICWE ![In: Proceedings of the 6th International Conference on Web Engineering, ICWE 2006, Palo Alto, California, USA, July 11-14, 2006, pp. 48-55, 2006, ACM, 1-59593-352-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
web image clustering, feature selection, association rules, web mining, hypergraphs, interestingness measures |
31 | Guillermo Morales-Luna |
Geometric Aspects Related to Solutions of #kSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2005: Advances in Artificial Intelligence, 4th Mexican International Conference on Artificial Intelligence, Monterrey, Mexico, November 14-18, 2005, Proceedings, pp. 132-141, 2005, Springer, 3-540-29896-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Hypercube Geometry, SAT, Hypergraphs, Counting |
31 | Igor E. Zverovich |
A Solution to a Problem of Jacobson, Kézdy and Lehel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(4), pp. 571-577, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Line graphs of linear hypergraphs, Forbidden induced subgraphs |
31 | Maria Axenovich, Zoltán Füredi |
Exact Bounds on the Sizes of Covering Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(1), pp. 21-38, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
supersaturated hypergraphs, Turán theorem, covering radius, binary codes |
31 | Hannah Honghua Yang, D. F. Wong 0001 |
New algorithms for min-cut replication in partitioned circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 216-222, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout |
23 | Laihao Ding, Jie Han, Shumin Sun, Guanghui Wang 0002, Wenling Zhou |
Tiling multipartite hypergraphs in quasi-random hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 160, pp. 36-65, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Jia-Wen Yang, Wen-Huan Wang |
The matching polynomials of hypergraphs and weighted hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 15(7), pp. 2250164:1-2250164:19, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Andriy Shapoval, Eva K. Lee |
Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 80(4), pp. 805-840, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Yi-Zheng Fan, Yi Wang, Jiang-Chao Wan |
Minimal Non-Odd-Transversal Hypergraphs and Minimal Non-Odd-Bipartite Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(4), pp. 4, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi |
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 34(4), pp. 2250-2269, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Alain Bretto, Alain Faisant, François Hennecart |
On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(11), pp. 112059, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | József Balogh, Danila D. Cherkashin, Sergei Kiselev |
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 79, pp. 228-236, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Sumera Naz, Muhammad Aslam Malik, Hossein Rashmanlou |
Hypergraphs and Transversals of Hypergraphs in Interval-valued Intuitionistic Fuzzy Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Multiple Valued Log. Soft Comput. ![In: J. Multiple Valued Log. Soft Comput. 30(4-6), pp. 399-417, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Qian Wang, Zengtai Gong |
An application of fuzzy hypergraphs and hypergraphs in granular computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 429, pp. 296-314, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Christian Reiher, Vojtech Rödl, Mathias Schacht |
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Lond. Math. Soc. ![In: J. Lond. Math. Soc. 97(1), pp. 77-97, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Kuei-Nuan Lin, P. Mantero |
Hypergraphs with high projective dimension and 1-dimensional hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 27(6), pp. 591-617, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Paul Balister, Béla Bollobás, Karen Gunderson |
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 57, pp. 85-93, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Wannasiri Wannasit |
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 60, pp. 227-254, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
23 | Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda |
Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 15(2), pp. 215-222, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Matthias Hein 0001, Simon Setzer, Leonardo Jost, Syama Sundar Rangapuram |
The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.5179, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | François Le Gall, Harumichi Nishimura, Seiichiro Tani |
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.4127, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Matthias Hein 0001, Simon Setzer, Leonardo Jost, Syama Sundar Rangapuram |
The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NIPS ![In: Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013, Lake Tahoe, Nevada, United States., pp. 2427-2435, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry |
Blocks of Hypergraphs - Applied to Hypergraphs and Outerplanarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, pp. 201-211, 2010, Springer, 978-3-642-19221-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Hortensia Galeana-Sánchez, Martín Manrique |
Directed hypergraphs: A tool for researching digraphs and hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 29(2), pp. 313-335, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Csilla Bujtás, Zsolt Tuza |
Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(22), pp. 6391-6401, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 382(2), pp. 139-150, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Ramiro Liscano, Andrew K. C. Wong, Shadia Elgazzar |
Bayesian attributed hypergraphs: a unified representation of Bayesian networks and hypergraphs for perceptual grouping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SMC ![In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, SMC 1998, Hyatt Regency La Jolla, San Diego, California, USA, October 11-14,1998, pp. 4517-4523, 1998, IEEE, 0-7803-4778-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Ch. Demko |
Generalization of Two Hypergraphs. Algorithm of Calculation of the Greatest Sub-Hypergraph Common to Two Hypergraphs Annotated by Semantic Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph Based Representations in Pattern Recognition, 1st Workshop, Lyon, France, 17-18 April 1997, pp. 1-9, 1997, Springer, 978-3-211-83121-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 3049 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|