Search results for "transversals"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
90	Alain Casali, Rosine Cicchetti, Lotfi Lakhal	Extracting semantics from data cubes using cube transversals and closures.	KDD	2003	DBLP DOI BibTeX RDF	algorithm, lattices, closures, version spaces, datacubes, hypergraph transversals
67	Olivier Devillers, Marc Glisse, Sylvain Lazard	Predicates for line transversals to lines and line segments in three-dimensional space.	SCG	2008	DBLP DOI BibTeX RDF	optimality, polynomial, predicate, line transversal
67	Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless	The number of transversals in a Latin square.	Des. Codes Cryptogr.	2006	DBLP DOI BibTeX RDF	AMS Classification 05B15
67	Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides	Transversals to Line Segments in Three-Dimensional Space.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
67	Javier Bracho, Luis Montejano 0001	Helly-Type Theorems on the Homology of the Space of Transversals.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
67	Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino	Generating Partial and Multiple Transversals of a Hypergraph.	ICALP	2000	DBLP DOI BibTeX RDF
64	Alain Casali	Mining Borders of the Difference of Two Datacubes.	DaWaK	2004	DBLP DOI BibTeX RDF
51	Haim Kaplan, Natan Rubin, Micha Sharir	Line transversals of convex polyhedra in R3.	SODA	2009	DBLP DOI BibTeX RDF
51	Georg Gottlob	Hypergraph Transversals.	FoIKS	2004	DBLP DOI BibTeX RDF
51	James Bailey 0001, Thomas Manoukian, Kotagiri Ramamohanarao	A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns.	ICDM	2003	DBLP DOI BibTeX RDF
48	Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich	A New Algorithm for the Hypergraph Transversal Problem.	COCOON	2005	DBLP DOI BibTeX RDF
42	Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter	Algorithms for finding clique-transversals of graphs.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Clique-transversals, Helly circular-arc graphs, free circular-arc graphs, Algorithms, Circular-arc graphs
42	Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter	On Clique-Transversals and Clique-Independent Sets.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	clique-independent sets, clique-perfect graphs, clique-transversals, highly clique-imperfect graphs, linear programming, integer linear programming
40	Kunalè Kudagba, Omar El Beqqali, Hassan Badir	Enriching and Answering Proteomic Queries Using Semantic Knowledges.	OTM Workshops	2009	DBLP DOI BibTeX RDF	?-terms, minimal Transversals, Ontology, XML, Semantic Web, Trees, WordNet, Query Rewriting, Proteomics
40	James Bailey 0001, Peter J. Stuckey	Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization.	PADL	2005	DBLP DOI BibTeX RDF	Minimal unsatisfiable sets, constraint solving, hitting sets, hypergraph transversals
40	Thomas Eiter, Kazuhisa Makino	Abduction and the Dualization Problem.	Discovery Science	2003	DBLP DOI BibTeX RDF	monotone dualization, Horn functions, polynomial total-time computation, NP-hardness, Abduction, model-based reasoning, hypergraph transversals
40	Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino	On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.	STACS	2002	DBLP DOI BibTeX RDF	infrequent sets, Data mining, independent sets, hitting sets, transversals, frequent sets, dualization
37	Anna A. Taranenko	Transversals, Near Transversals, and Diagonals in Iterated Groups and Quasigroups.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
37	Sylvain Guillemot	FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs.	IWPEC	2008	DBLP DOI BibTeX RDF
35	Otfried Cheong	Line Transversals and Pinning Numbers.	WALCOM	2009	DBLP DOI BibTeX RDF
35	Ciprian Borcea, Xavier Goaoc, Sylvain Petitjean	Line Transversals to Disjoint Balls.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Geometric permutation, Convexity, Transversal
35	Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen, Sylvain Petitjean	Helly-Type Theorems for Line Transversals to Disjoint Unit Balls.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Geometric transversal theory, Helly-type theorem, Hadwiger-type theorem, Spheres, Line transversal, Balls
35	Roman N. Karasev	Tverberg's Transversal Conjecture and Analogues of Nonembeddability Theorems for Transversals.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
35	Ciprian Borcea, Xavier Goaoc, Sylvain Petitjean	Line transversals to disjoint balls.	SCG	2007	DBLP DOI BibTeX RDF	Hadwiger-type theorem, Helly-type theorem, disjoint balls, geometric transversal theory, convexity, lines, Hessian
35	Tibor Szabó, Gábor Tardos	Extremal Problems For Transversals In Graphs With Bounded Degree.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05D15, 05C69, 05C15
35	Gábor Megyesi, Frank Sottile, Thorsten Theobald	Common Transversals and Tangents to Two Lines and Two Quadrics in P.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
35	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan	An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals.	ESA	2003	DBLP DOI BibTeX RDF
35	Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na	Disjoint Unit Spheres admit at Most Two Line Transversals.	ESA	2003	DBLP DOI BibTeX RDF
35	Jorge L. Arocha, Javier Bracho, Luis Montejano 0001, Deborah Oliveros, Ricardo Strausz	Separoids, Their Categories and a Hadwiger-Type Theorem for Transversals.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
35	Thomas Eiter, Georg Gottlob, Kazuhisa Makino	New results on monotone dualization and generating hypergraph transversals.	STOC	2002	DBLP DOI BibTeX RDF	combinatorial enumeration, hypergraph acyclicity, limited nondeterminism, output-polynomial algorithms, transversal computation, treewidth, dualization
35	Pankaj K. Agarwal, Boris Aronov, Micha Sharir	Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
35	Jacob E. Goodman, Richard Pollack, Rephael Wenger	Bounding the Number of Geometric Permutations Induced by k-Transversals.	SCG	1994	DBLP DOI BibTeX RDF
35	Dimitris J. Kavvadias, Christos H. Papadimitriou, Martha Sideri	On Horn Envelopes and Hypergraph Transversals.	ISAAC	1993	DBLP DOI BibTeX RDF
35	Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger	The Combinatorial Complexity of Hyperplane Transversals.	SCG	1990	DBLP DOI BibTeX RDF
32	Kelli Baumgartner, Silvia Ferrari	A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks.	IEEE Trans. Computers	2008	DBLP DOI BibTeX RDF
32	Céline Hébert, Alain Bretto, Bruno Crémilleux	Optimizing hypergraph transversal computation with an anti-monotone constraint.	SAC	2007	DBLP DOI BibTeX RDF
32	Dimitrios Gunopulos, Roni Khardon, Heikki Mannila, Sanjeev Saluja, Hannu Toivonen, Ram Sewak Sharm	Discovering all most specific sentences.	ACM Trans. Database Syst.	2003	DBLP DOI BibTeX RDF	learning with membership queries, maximal frequent sets, minimal keys, Data mining, association rules
32	Vladlen Koltun, Micha Sharir	On the overlay of envelopes in four dimensions.	SODA	2002	DBLP BibTeX RDF
24	David Eppstein, Michael T. Goodrich, Lowell Trott	Going off-road: transversal complexity in road networks.	GIS	2009	DBLP DOI BibTeX RDF	edge crossings, multiscale-dispersed graphs, ray-shooting data structures, road networks, geometric graphs, line transversals
24	Evangelia Pyrga, Saurabh Ray	New existence proofs epsilon-nets.	SCG	2008	DBLP DOI BibTeX RDF	strong ?-nets, discrete geometry, hitting sets, hypergraph transversals
24	Radoslav Fulek, Andreas F. Holmsen, János Pach	Intersecting convex sets by rays.	SCG	2008	DBLP DOI BibTeX RDF	depth in arrangements, convex sets, transversals
24	Peter Damaschke	The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting.	STACS	2007	DBLP DOI BibTeX RDF	combinatorial inference, algorithms, parameterization, counting, hypergraph transversals
24	Takashi Harada, Masafumi Yamashita	Transversal Merge Operation: A Nondominated Coterie Construction Method for Distributed Mutual Exclusion.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	grid structures, nondominatedness, distributed systems, Coteries, transversals, quorum consensus, mutual exclusion algorithms
24	Paul Fischer, Hans Ulrich Simon	Separation Problems and Circular Arc Systems.	WG	1990	DBLP DOI BibTeX RDF	separating polygons, separating planar subdivisions, circular arc systems, number of stages, computational geometry, visibility, transversals, intersection graphs, computational learning
24	Maree Hegarty, John D. Smith, David Hamilton	Herbicide Advisory Systems: Weeds in Wheat and other Crops.	Australian Joint Conference on Artificial Intelligence	1988	DBLP DOI BibTeX RDF	list transversals, herbicide advice, PC implementation, expert system
18	Jake Ruotolo, Kevin Wang, Fan Wei	An Asymptotically Sharp Bound on the Maximum Number of Independent Transversals.	Electron. J. Comb.	2024	DBLP DOI BibTeX RDF
18	K. K. Myithili, R. D. Beulah	Selection of appropriate location of turbines using score function in transversals of an intuitionistic fuzzy soft hypergraphs.	J. Intell. Fuzzy Syst.	2024	DBLP DOI BibTeX RDF
18	Robin D. P. Zhou, Sherry H. F. Yan	Equidistribution of set-valued statistics on standard Young tableaux and transversals.	Adv. Appl. Math.	2024	DBLP DOI BibTeX RDF
18	Joseph Briggs, Michael Gene Dobbins, Seunghun Lee	Transversals and Colorings of Simplicial Spheres.	Discret. Comput. Geom.	2024	DBLP DOI BibTeX RDF
18	Michael A. Henning, Anders Yeo	Transversals in regular uniform hypergraphs.	J. Graph Theory	2024	DBLP DOI BibTeX RDF
18	Euiwoong Lee, Pengxiang Wang 0002	Strong hardness of approximation for tree transversals.	Inf. Process. Lett.	2023	DBLP DOI BibTeX RDF
18	Daniel McGinnis	A Necessary and Sufficient Condition for (2d-2)-Transversals in $\mathbb {R}^{2d}$.	Comb.	2023	DBLP DOI BibTeX RDF
18	Ingrid Guevara, Salvador Godoy-Calderón, Eduardo Alba-Cabrera	Adding Learning Capabilities to the LEX Algorithm for Computing Minimal Transversals.	Computación y Sistemas (CyS)	2023	DBLP BibTeX RDF
18	Attila Jung, Dömötör Pálvölgyi	k-dimensional transversals for balls.	CoRR	2023	DBLP DOI BibTeX RDF
18	Martin Milanic, Yushi Uno	Upper clique transversals in graphs.	CoRR	2023	DBLP DOI BibTeX RDF
18	Chaya Keller, Micha A. Perles	An (א0, k+2)-Theorem for k-Transversals.	CoRR	2023	DBLP DOI BibTeX RDF
18	A. L. Perezhogin, Vladimir N. Potapov, S. Yu. Vladimirov	Every latin hypercube of order 5 has transversals.	CoRR	2023	DBLP DOI BibTeX RDF
18	Felicia Lucke, Bernard Ries	On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
18	Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski	A precise condition for independent transversals in bipartite covers.	CoRR	2023	DBLP DOI BibTeX RDF
18	Wilder P. Mendes, Simone Dantas, Sylvain Gravier	A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
18	Henry A. Kierstead, Eric R. Ren	Improved upper bounds on longest-path and maximal-subdivision transversals.	Discret. Math.	2023	DBLP DOI BibTeX RDF
18	Stephen Gould, Tom Kelly 0001	Hamilton transversals in random Latin squares.	Random Struct. Algorithms	2023	DBLP DOI BibTeX RDF
18	Carla Groenland, Tomás Kaiser, Oscar Treffers, Matthew Wales	Graphs of low average degree without independent transversals.	J. Graph Theory	2023	DBLP DOI BibTeX RDF
18	Martin Milanic, Yushi Uno	Upper Clique Transversals in Graphs.	WG	2023	DBLP DOI BibTeX RDF
18	Stefan Glock, Benny Sudakov	An average degree condition for independent transversals.	J. Comb. Theory, Ser. B	2022	DBLP DOI BibTeX RDF
18	Juan José Montellano-Ballesteros	Transversals of Total Strict Linear Orders.	Order	2022	DBLP DOI BibTeX RDF
18	Alessandra Graf, David G. Harris 0001, Penny Haxell	Algorithms for Weighted Independent Transversals and Strong Colouring.	ACM Trans. Algorithms	2022	DBLP DOI BibTeX RDF
18	Daniel McGinnis, Shira Zerbib	Line Transversals in Families of Connected Sets in the Plane.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
18	Nick Brettell, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma	Computing subset transversals in H-free graphs.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
18	Nick Brettell, Matthew Johnson 0002, Daniël Paulusma	Computing Weighted Subset Odd Cycle Transversals in H-free graphs.	J. Comput. Syst. Sci.	2022	DBLP DOI BibTeX RDF
18	Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider	Well-Separation and Hyperplane Transversals in High Dimensions.	CoRR	2022	DBLP DOI BibTeX RDF
18	Honhglian Shen, Xiuling Shan, Zihong Tian	A new chaotic image encryption algorithm based on transversals in a Latin square.	CoRR	2022	DBLP BibTeX RDF
18	Arijit Ghosh, Soumi Nandi	Heterochromatic Higher Order Transversals for Convex Sets.	CoRR	2022	DBLP DOI BibTeX RDF
18	Honglian Shen, Xiuling Shan, Ming Xu, Zihong Tian	A New Chaotic Image Encryption Algorithm Based on Transversals in a Latin Square.	Entropy	2022	DBLP DOI BibTeX RDF
18	Ross J. Kang, Tom Kelly 0001	Colorings, transversals, and local sparsity.	Random Struct. Algorithms	2022	DBLP DOI BibTeX RDF
18	Chaya Keller, Micha A. Perles	An (ℵ₀, k+2)-Theorem for k-Transversals.	SoCG	2022	DBLP DOI BibTeX RDF
18	Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider	Well-Separation and Hyperplane Transversals in High Dimensions.	SWAT	2022	DBLP DOI BibTeX RDF
18	Raphael Yuster	On Factors of Independent Transversals in $k$-Partite Graphs.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
18	Peter Bradshaw	Transversals and Bipancyclicity in Bipartite Graph Families.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
18	Jaromy Kuhl, Donald McGinn, Michael W. Schroeder	Completing Partial Transversals of Cayley Tables of Abelian Groups.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
18	James A. Long Jr., Kevin G. Milans, Andrea Munaro	Sublinear Longest Path Transversals.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
18	Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza	Reducing graph transversals via edge contractions.	J. Comput. Syst. Sci.	2021	DBLP DOI BibTeX RDF
18	Michael A. Henning, Anders Yeo	Affine Planes and Transversals in 3-Uniform Linear Hypergraphs.	Graphs Comb.	2021	DBLP DOI BibTeX RDF
18	Anthony B. Evans, Adam Mammoliti, Ian M. Wanless	Latin squares with maximal partial transversals of many lengths.	J. Comb. Theory, Ser. A	2021	DBLP DOI BibTeX RDF
18	Euiwoong Lee, Pengxiang Wang 0002	Strong Hardness of Approximation for Tree Transversals.	CoRR	2021	DBLP BibTeX RDF
18	Michael A. Henning, Anders Yeo	Lower bounds on Tuza constants for transversals in linear uniform hypergraphs.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
18	Juan Gutiérrez	Transversals of longest cycles in partial k-trees and chordal graphs.	J. Graph Theory	2021	DBLP DOI BibTeX RDF
18	Jonathan Chappelon	Steinhaus triangles and graphs and contributions to numerical semigroups, Tower of Hanoi problems, Ramsey theory and Kneser transversals.		2021	RDF
18	Alessandra Graf, David G. Harris 0001, Penny Haxell	Algorithms for weighted independent transversals and strong colouring.	SODA	2021	DBLP DOI BibTeX RDF
18	Nick Brettell, Matthew Johnson 0002, Daniël Paulusma	Computing Weighted Subset Transversals in H-Free Graphs.	WADS	2021	DBLP DOI BibTeX RDF
18	Giacomo Paesani	Graph transversals for hereditary graph classes : a complexity perspective		2021	RDF
18	Alessandra Graf, Penny Haxell	Finding independent transversals efficiently.	Comb. Probab. Comput.	2020	DBLP DOI BibTeX RDF
18	Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.	Algorithmica	2020	DBLP DOI BibTeX RDF
18	James A. Long Jr., Kevin G. Milans, Andrea Munaro	Sublinear Longest Path Transversals and Gallai Families.	CoRR	2020	DBLP BibTeX RDF
18	Nick Brettell, Matthew Johnson 0002, Daniël Paulusma	Computing Weighted Subset Transversals in H-Free Graphs.	CoRR	2020	DBLP BibTeX RDF
18	Nick Brettell, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma	Computing Subset Transversals in H-Free Graphs.	CoRR	2020	DBLP BibTeX RDF
18	Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal	Multi-transversals for Triangles and the Tuza's Conjecture.	CoRR	2020	DBLP BibTeX RDF
18	Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza	Reducing graph transversals via edge contractions.	CoRR	2020	DBLP BibTeX RDF
18	Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima	Transversals of longest paths.	Discret. Math.	2020	DBLP DOI BibTeX RDF
18	Patrick Schnider	Ham-Sandwich Cuts and Center Transversals in Subspaces.	Discret. Comput. Geom.	2020	DBLP DOI BibTeX RDF