|
|
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 |
23 | Robert Endre Tarjan, Mihalis Yannakakis |
Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 14(1), pp. 254-255, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
23 | Robert Endre Tarjan, Mihalis Yannakakis |
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 13(3), pp. 566-579, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
23 | John I. Moore Jr. |
Interval hypergraphs and D-interval hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 17(2), pp. 173-179, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
22 | Yury Person, Mathias Schacht |
Almost all hypergraphs without Fano planes are bipartite. ![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. 217-226, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Nitish Korula, Martin Pál |
Algorithms for Secretary Problems on Graphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 508-520, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Geir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja |
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 12-23, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski 0001 |
An approximate Dirac-type theorem for k -uniform hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(2), pp. 229-260, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C65, 05C45, 05D05 |
22 | László Babai, Paolo Codenotti |
Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 667-676, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky |
Online Conflict-Free Colorings for Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 219-230, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Luc Gillibert, Alain Bretto |
Hypergraphs for Near-lossless Volumetric Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2-4 April 2007, Las Vegas, Nevada, USA, pp. 229-233, 2007, IEEE Computer Society, 978-0-7695-2776-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Magnús M. Halldórsson, Elena Losievskaja |
Independent Sets in Bounded-Degree Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 263-274, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Michael Behrisch 0002, Amin Coja-Oghlan, Mihyun Kang |
Local Limit Theorems for the Giant Component of Random 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. 341-352, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Gabriel Wachman, Roni Khardon |
Learning from interpretations: a rooted kernel for ordered hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvallis, Oregon, USA, June 20-24, 2007, pp. 943-950, 2007, ACM, 978-1-59593-793-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Ben Goertzel |
Patterns, Hypergraphs and Embodied General Intelligence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 2006, part of the IEEE World Congress on Computational Intelligence, WCCI 2006, Vancouver, BC, Canada, 16-21 July 2006, pp. 451-458, 2006, IEEE, 0-7803-9490-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Youssef Saab |
An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(6), pp. 641-652, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Sanjay Chawla, Joseph G. Davis, Gaurav Pandey |
On Local Pruning of Association Rules Using Directed Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 20th International Conference on Data Engineering, ICDE 2004, 30 March - 2 April 2004, Boston, MA, USA, pp. 832, 2004, IEEE Computer Society, 0-7695-2065-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Antonio Bucciarelli, Benjamin Leperchey |
Hypergraphs and Degrees of Parallelism: A Completeness Result. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, pp. 58-71, 2004, Springer, 3-540-21298-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Geir Agnarsson, Magnús M. Halldórsson |
Strong Colorings of Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers, pp. 253-266, 2004, Springer, 3-540-24574-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
strong coloring, composition width, approximation, hypergraph |
22 | Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani |
Counting Connected Graphs and Hypergraphs via the Probabilistic Method. ![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. 322-333, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Georg Sander |
Layout of Directed Hypergraphs with Orthogonal Hyperedges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, pp. 381-386, 2003, Springer, 3-540-20831-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Alexandr V. Kostochka |
Transversals in Uniform Hypergraphs with Property (p, 2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(2), pp. 275-285, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C65 |
22 | Hiro Ito, Hiroshi Nagamochi |
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, pp. 176-181, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl |
Efficient Testing of 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. 1017-1028, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | 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 |
|
22 | Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni |
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings, pp. 312-327, 2001, Springer, 3-540-42672-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Directed hypergraph, minimum weight hyperpath, dynamic algorithm, AND/OR graph |
22 | Catherine S. Greenhill |
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 9(1), pp. 52-72, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
#P-completeness, interpolation, independent sets, Graph colourings |
22 | Alexandr V. Kostochka, Michael Stiebitz |
On the Number of Edges in Colour-Critical Graphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(4), pp. 521-530, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C15 |
22 | François Bertault, Peter Eades |
Drawing Hypergraphs in the Subset Standard (Short Demo Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings, pp. 164-169, 2000, Springer, 3-540-41554-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Michel Bauderon, Hélène Jacquet |
Node Rewriting in Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 31-43, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
22 | Andrew Chi-Chih Yao |
Hypergraphs and Decision Trees (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 1, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
22 | Andrea Maggiolo-Schettini, Józef Winkowski |
A Programming Language for Deriving Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings, pp. 221-231, 1992, Springer, 3-540-55251-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
22 | Carlo Batini, Alessandro D'Atri |
Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980, pp. 177-194, 1980, Springer, 3-540-10291-4. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
22 | David Duris |
Hypergraph Acyclicity and Extension Preservation Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 418-427, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hypergraph acyclicity, preservation theorems, logic, finite model theory |
22 | Yuichi Kameda, Hiroo Tokunaga, Akihiro Yamamoto |
Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008, Proceedings, pp. 98-110, 2008, Springer, 978-3-540-88008-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Evangelia Pyrga, Saurabh Ray |
New existence proofs epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 199-207, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
strong ?-nets, discrete geometry, hitting sets, hypergraph transversals |
22 | Artem Polyvyanyy, Mathias Weske |
Hypergraph-Based Modeling of Ad-Hoc Business Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Business Process Management Workshops ![In: Business Process Management Workshops, BPM 2008 International Workshops, Milano, Italy, September 1-4, 2008. Revised Papers, pp. 278-289, 2008, Springer, 978-3-642-00327-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hypergraph-structured process, ad-hoc process, process formalism, execution semantics, Business process modeling |
22 | Pierre Colomb, Lhouari Nourine |
About Keys of Formal Context and Conformal Hypergraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFCA ![In: Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings, pp. 140-149, 2008, Springer, 978-3-540-78136-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Peter Damaschke |
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 32-42, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Khaled M. Elbassioni, Matthias Hagen, Imran Rauf |
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 91-102, 2008, Springer, 978-3-540-79722-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Edward B. Allen, Sampath Gottipati, Rajiv Govindarajan |
Measuring size, complexity, and coupling of hypergraph abstractions of software: An information-theory approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Softw. Qual. J. ![In: Softw. Qual. J. 15(2), pp. 179-212, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Properties of metrics, C++ case studies, Complexity, Entropy, Software metrics, Information theory, Coupling, Size, Measurement theory, Excess entropy |
22 | Eldar Fischer, Arie Matsliah, Asaf Shapira |
Approximate Hypergraph Partitioning and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 579-589, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Anup Rao 0001 |
Extractors for a constant number of polynomially small min-entropy independent sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 497-506, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
independent sources, extractor, Ramsey graphs |
22 | Francesco Scarcello |
Query answering exploiting structural properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Rec. ![In: SIGMOD Rec. 34(3), pp. 91-99, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Satoru Endo, Toshiyuki Miyamoto, Sadatoshi Kumagai, Taku Fujii |
On Simulation of BPEL4WS/UML Descriptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 12th Asia-Pacific Software Engineering Conference (APSEC 2005), 15-17 December 2005, Taipei, Taiwan, pp. 103-112, 2005, IEEE Computer Society, 0-7695-2465-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Peter Veelaert |
Uncertain Geometry in Computer Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 12th International Conference, DGCI 2005, Poitiers, France, April 13-15, 2005, Proceedings, pp. 359-370, 2005, Springer, 3-540-25513-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Alain Bretto, Luc Gillibert |
Hypergraph Lossless Image Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC (1) ![In: International Symposium on Information Technology: Coding and Computing (ITCC 2005), Volume 1, 4-6 April 2005, Las Vegas, Nevada, USA, pp. 46-50, 2005, IEEE Computer Society, 0-7695-2315-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Tom Bohman, Ron Holzman |
Linear Versus Hereditary Discrepancy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(1), pp. 39-47, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C65, 11K38 |
22 | Michelle Mills Strout, Paul D. Hovland |
Metrics and models for reordering transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Memory System Performance ![In: Proceedings of the 2004 workshop on Memory System Performance, Washington, DC, USA, June 8, 2004, pp. 23-34, 2004, ACM, 1-58113-941-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
inspector/executor, locality metrics, run-time reordering transformations, spatial locality graph, temporal locality hypergraph, optimization, data locality |
22 | Olivier Ly |
Compositional Verification: Decidability Issues Using Graph Substitutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 537-549, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Tree Automata, Compositional Verification, Monadic Second-Order Logic |
22 | Francesco Scarcello, Gianluigi Greco, Nicola Leone |
Weighted Hypertree Decompositions and Optimal Query Plans. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France, pp. 210-221, 2004, ACM, 1-58113-858-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Aleksandar Trifunovic, William J. Knottenbelt |
Towards a Parallel Disk-Based Algorithm for Multilevel k-way Hypergraph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Dana Angluin, Jiang Chen |
Learning a Hidden Graph Using O(log n) Queries Per Edge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings, pp. 210-223, 2004, Springer, 3-540-22282-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Subhash Khot |
Hardness results for approximate hypergraph coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 351-359, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Artur Czumaj, Christian Sohler |
Testing Hypergraph Coloring. ![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. 493-505, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ![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. 92-103, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Hypertree Decompositions: A Survey. ![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. 37-57, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Georg Gottlob, Nicola Leone, Francesco Scarcello |
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA, 2001, ACM, 1-58113-361-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Catharine M. Wyss, Chris Giannella, Edward L. Robertson |
FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DaWaK ![In: Data Warehousing and Knowledge Discovery, Third International Conference, DaWaK 2001, Munich, Germany, September 5-7, 2001, Proceedings, pp. 101-110, 2001, Springer, 3-540-42553-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Benjamin Doerr |
Structured Randomized Rounding and Coloring. ![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. 461-471, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
hypergraph coloring, randomized algorithms, integer linear programming, discrepancy, randomized rounding |
22 | Benjamin Doerr, Anand Srivastav |
Recursive Randomized Coloring Beats Fair Dice Random Colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 183-194, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
Generating Partial and Multiple Transversals of a Hypergraph. ![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. 588-599, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss |
Coloring Mixed Hypertrees. ![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. 279-289, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | David A. Grable |
More-Than-Nearly-Perfect Packings and Partial Designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(2), pp. 221-239, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C70, 05B05 |
22 | Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin |
Dually Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings, pp. 237-251, 1993, Springer, 3-540-57899-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
22 | Carolyn R. Watters, Michael A. Shepherd |
A Transient Hypergraph-Based Model for Data Access. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Inf. Syst. ![In: ACM Trans. Inf. Syst. 8(2), pp. 77-102, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
22 | Ronald Fagin |
Acyclic Database Schemes (of Various Degrees): A Painless Introduction. ![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. 65-89, 1983, Springer, 3-540-12727-5. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
Additional Key Words and Phrases acyclic, database scheme, relational database, hypergraph |
22 | Ronald Fagin, Alberto O. Mendelzon, Jeffrey D. Ullman |
A Simplified Universal Relation Assumption and Its Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 7(3), pp. 343-360, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
database scheme, relational database, hypergraph, multivalued dependency, acyclic, join dependency |
22 | Nathan Goodman, Oded Shmueli |
Tree Queries: A Simple Class of Relational Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 7(4), pp. 653-677, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
acyclic schemes, cyclic schemas, tree schemas, join, semijoin |
20 | Martin Otto 0001 |
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom, pp. 11-20, 2010, IEEE Computer Society, 978-0-7695-4114-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
hypergraphs, finite model theory, acyclicity, guarded fragment |
20 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky |
Coloring Geometric Range Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 348-362, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Geometric hypergraphs, Decompositions, Coloring, Covering |
20 | Georg Gottlob, Gianluigi Greco, Zoltán Miklós 0001, Francesco Scarcello, Thomas Schwentick |
Tree Projections: Game Characterization and Computational Aspects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Theory, Computational Intelligence and Thought ![In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp. 217-226, 2009, Springer, 978-3-642-02028-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
tree projections, computational complexity, hypergraphs |
20 | Thomas Neumann 0001 |
Query simplification: graceful degradation for join-order optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2009, Providence, Rhode Island, USA, June 29 - July 2, 2009, pp. 403-414, 2009, ACM, 978-1-60558-551-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
complex joins, query optimization, hypergraphs |
20 | Asaf Shapira |
Green's conjecture and testing linear-invariant properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 159-166, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hypergraphs removal lemma, boolean functions, property testing |
20 | Hanno Lefmann |
Distributions of Points in d Dimensions and Large k -Point Simplices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(3), pp. 401-413, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Heilbronn’s triangle problem, Hypergraphs, Independence number |
20 | Marc Bezem, Robert Nieuwenhuis, Enric Rodríguez-Carbonell |
The Max-Atom Problem and Its Relevance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 47-61, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
constraints, hypergraphs, max-plus algebra |
20 | Guido Moerkotte, Thomas Neumann 0001 |
Dynamic programming strikes back. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 539-552, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
complex joins, query optimization, hypergraphs |
20 | Jean-Pierre Barthélemy, François Brucker, Christophe Osswald |
Combinatorial optimisation and hierarchical classifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 153(1), pp. 179-214, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Quasi-hierarchies, Rigid hypergraphs, Subdominant, Complexity, Clustering algorithms, Hierarchical classification |
20 | Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos |
Datalog programs and their persistency numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(3), pp. 481-518, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bounded-tree width hypergraphs, persistency numbers, persistent variables, program transformations, Datalog, finite automata, Boundedness |
20 | Boualem Benatallah, Mohand-Said Hacid, Alain Léger, Christophe Rey, Farouk Toumani |
On automating Web services discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 14(1), pp. 84-96, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Description logics, Hypergraphs, Web services Discovery, Semantic matchmaking |
20 | Jean-Pierre Barthélemy, François Brucker, Christophe Osswald |
Combinatorial optimization and hierarchical classifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 2(3), pp. 179-219, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
quasi-hierarchies, rigid hypergraphs, subdominant, complexity, clustering algorithms, Hierarchical classification |
20 | Jörg Flum, Markus Frick, Martin Grohe |
Query evaluation via tree-decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(6), pp. 716-752, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Acyclic conjunctive queries, combined complexity, hypergraphs, monadic second-order logic, tree-width |
20 | Harvey Friedman |
Some Decision Problems of Enormous Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 2-12, 1999, IEEE Computer Society, 0-7695-0158-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
proof thoery, complexity, trees, hypergraphs, ordinals |
20 | Youssef Saab |
A Fast and Robust Network Bisection Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 44(7), pp. 903-913, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
VLSI networks, approximation algorithms, hypergraphs, Bisection, iterative improvement |
20 | Airi Salminen, Jean Tague-Sutcliffe, Charles McClellan |
From Text to Hypertext by Indexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Inf. Syst. ![In: ACM Trans. Inf. Syst. 13(1), pp. 69-99, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
constrained grammars, test types, text entities, transient hypergraphs, hypertext, grammars, properties, structured text |
20 | John D. Kececioglu, Dan Gusfield |
Reconstructing a History of Recombinations from a Set of Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA., pp. 471-480, 1994, ACM/SIAM, 0-89871-329-3. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
bottleneck optimality, directed hypergraphs, computational biology, edit distance, recombination, evolutionary trees |
20 | David R. Karger, Daphne Koller |
(De)randomized Construction of Small Sample Spaces in \calNC ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 252-263, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
general probabilistic analysis, derandomized construction, small sample spaces, compact distributions, d-uniform hypergraphs, parallel algorithm, linear programming, finite automata |
20 | Bernard Chazelle, Joel Friedman |
A Deterministic View of Random Sampling and its Use in Geometry ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 539-549, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
polynomial preprocessing, deterministic view, efficient probabilistic algorithms, polynomial overhead, probabilistic bounds, geometry complexity, simplicial packing, storage, polynomial time, random sampling, hypergraphs, divide-and-conquer, derandomized, hyperplanes |
11 | Ying Wang 0009, Yingji Li, Yue Wu, Xin Wang |
Exploring Multiple Hypergraphs for Heterogeneous Graph Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 236, pp. 121230, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Yiting Jiang, Jaroslav Nesetril |
Minimal asymmetric hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 164, pp. 105-118, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | K. K. Myithili, R. D. Beulah |
Selection of appropriate location of turbines using score function in transversals of an intuitionistic fuzzy soft hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Fuzzy Syst. ![In: J. Intell. Fuzzy Syst. 46(4), pp. 8205-8212, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Guoliang Qiu 0001, Jiaheng Wang 0002 |
Inapproximability of counting independent sets in linear hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 184, pp. 106448, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Reynaldo Gil Pons, Max Ward 0001, Loïc Miller |
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 184, pp. 106433, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Florian Hörsch, Zoltán Szigeti |
Steiner connectivity problems in hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 183, pp. 106428, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Md. Tanvir Alam, Chowdhury Farhan Ahmed, Md. Samiullah 0001, Carson Kai-Sang Leung |
Discovering Interesting Patterns from Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Knowl. Discov. Data ![In: ACM Trans. Knowl. Discov. Data 18(1), pp. 32:1-32:34, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Oana Balalau, Francesco Bonchi, T.-H. Hubert Chan, Francesco Gullo, Mauro Sozio, Hao Xie |
Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Knowl. Discov. Data ![In: ACM Trans. Knowl. Discov. Data 18(4), pp. 95:1-95:21, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Qi Luo, Zhenzhen Xie, Yu Liu, Dongxiao Yu, Xiuzhen Cheng 0001, Xuemin Lin 0001, Xiaohua Jia |
Sampling hypergraphs via joint unbiased random walk. ![Search on Bibsonomy](Pics/bibsonomy.png) |
World Wide Web (WWW) ![In: World Wide Web (WWW) 27(2), pp. 15, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Waheed Ahmad Khan, Waqar Arif, Hossein Rashmanlou, Saeed Kosari |
Interval-valued picture fuzzy hypergraphs with application towards decision making. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. Comput. ![In: J. Appl. Math. Comput. 70(2), pp. 1103-1125, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Dhruv Mubayi, Lea Weber |
Large cliques or cocliques in hypergraphs with forbidden order-size pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 33(3), pp. 286-299, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Jiuqiang Liu, Shenggui Zhang, Guihai Yu |
Generating functions and counting formulas for spanning trees and forests in hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 155, pp. 102667, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
11 | Alejandro Álvarez-Ayllón, Manuel Palomo-Duarte, Juan Manuel Dodero |
PresQ: Discovery of Multidimensional Equally-Distributed Dependencies via Quasi-Cliques on Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Emerg. Top. Comput. ![In: IEEE Trans. Emerg. Top. Comput. 12(1), pp. 224-239, January - March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 3049 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|