Search results for "matchings"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
97	Telikepalli Kavitha, Julián Mestre, Meghana Nasre	Popular Mixed Matchings.	ICALP (1)	2009	DBLP DOI BibTeX RDF
87	Criel Merino, Gelasio Salazar, Jorge Urrutia	On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Minimum weight perfect matchings, Perfect matchings, Geometric graphs
86	Elliot Anshelevich, Sanmay Das, Yonatan Naamad	Anarchy, Stability, and Utopia: Creating Better Matchings.	SAGT	2009	DBLP DOI BibTeX RDF
86	Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda	Random Bichromatic Matchings.	Algorithmica	2008	DBLP DOI BibTeX RDF	Markov chains, Sampling, Matchings, Approximate counting
65	Micha Sharir, Emo Welzl	On the number of crossing-free matchings, (cycles, and partitions).	SODA	2006	DBLP DOI BibTeX RDF
65	Bin He 0001, Kevin Chen-Chuan Chang, Jiawei Han 0001	Discovering complex matchings across web query interfaces: a correlation mining approach.	KDD	2004	DBLP DOI BibTeX RDF	correlation measure, data integration, schema matching, deep Web, correlation mining
65	Bin He 0001, Kevin Chen-Chuan Chang, Jiawei Han 0001	Mining complex matchings across Web query interfaces.	DMKD	2004	DBLP DOI BibTeX RDF
65	Josep Díaz, Jordi Petit, Panagiotis Psycharis, Maria J. Serna	A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution.	ISAAC	1998	DBLP DOI BibTeX RDF
65	Oliver Giel, Ingo Wegener	Maximum cardinality matchings on trees by randomized local search.	GECCO	2006	DBLP DOI BibTeX RDF	maximum cardinality matchings, randomized local search, evolutionary algorithms, runtime analysis
64	Bin He 0001, Kevin Chen-Chuan Chang	Automatic complex schema matching across Web query interfaces: A correlation mining approach.	ACM Trans. Database Syst.	2006	DBLP DOI BibTeX RDF	bagging predictors, Data integration, ensemble, schema matching, deep Web, correlation mining
55	Eric McDermid, Robert W. Irving	Popular Matchings: Structure and Algorithms.	COCOON	2009	DBLP DOI BibTeX RDF
55	Nicholas J. A. Harvey, Richard E. Ladner, László Lovász 0001, Tami Tamir	Semi-matchings for Bipartite Graphs and Load Balancing.	WADS	2003	DBLP DOI BibTeX RDF
54	Andreas Björklund, Thore Husfeldt	Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.	Algorithmica	2008	DBLP DOI BibTeX RDF	Exact satisfability, Number of perfect matchings, Set cover, Exact algorithms, Set partition
54	Mark Huber	Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs.	Algorithmica	2006	DBLP DOI BibTeX RDF	Perfect sampling, Bregman's theorem, Minc's conjecture, Approximation algorithms, Perfect matchings, Permanent
54	Steven A. Borbash, Anthony Ephremides	The feasibility of matchings in a wireless network.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	wireless networks, matchings, power control, interference, feasibility
46	Andreas Brandstädt, Raffaele Mosca	On Distance-3 Matchings and Induced Matchings.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF	Distance-k matching, Maximum Distance-k Matching Problem, Maximum Induced Matching Problem, chordal graphs
44	Denis Xavier Charles, Max Chickering, Nikhil R. Devanur, Kamal Jain, Manan Sanghi	Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads.	EC	2010	DBLP DOI BibTeX RDF	selling display advertisements, linear programming, online algorithms, bipartite matching
44	Ashish Goel, Michael Kapralov, Sanjeev Khanna	Perfect matchings via uniform sampling in regular bipartite graphs.	SODA	2009	DBLP DOI BibTeX RDF
44	Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer	Minimizing the Stabbing Number of Matchings, Trees, and Triangulations.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Stabbing number, Complexity, Matching, Triangulation, Spanning tree, Linear programming relaxation, Iterated rounding
44	Ignaz Rutter, Alexander Wolff 0001	Computing large matchings fast.	SODA	2008	DBLP BibTeX RDF
44	Christine T. Cheng	The Generalized Median Stable Matchings: Finding Them Is Not That Easy.	LATIN	2008	DBLP DOI BibTeX RDF
44	Marcin Mucha, Piotr Sankowski	Maximum Matchings in Planar Graphs via Gaussian Elimination.	Algorithmica	2006	DBLP DOI BibTeX RDF	Planar graphs, Maximum matching, Fast matrix multiplication
44	Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda	Random Bichromatic Matchings.	LATIN	2006	DBLP DOI BibTeX RDF
44	Lin Hu, Xueliang Li 0001	Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs.	CJCDGCGT	2005	DBLP DOI BibTeX RDF
44	Zvi Gotthilf, Moshe Lewenstein	Tighter Approximations for Maximum Induced Matchings in Regular Graphs.	WAOA	2005	DBLP DOI BibTeX RDF
44	Ravi Musunuri, Jorge Arturo Cobb	Distributed out-bound load balancing in inter-AS routing by random matchings.	Telecommun. Syst.	2007	DBLP DOI BibTeX RDF	Inter-AS routing, Random matchings, Load balancing, Border Gateway Protocol (BGP), Traffic engineering
42	David J. Abraham, Ariel Levavi, David F. Manlove, Gregg O'Malley	The Stable Roommates Problem with Globally-Ranked Pairs.	WINE	2007	DBLP DOI BibTeX RDF
42	Hidetaka Matsumura, Keishi Tajima	Incremental evaluation of a monotone XPath fragment.	CIKM	2005	DBLP DOI BibTeX RDF	XML, query, XPath, continuous, view, materialized view, view maintenance, incremental evaluation
42	Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee	Parallel algorithms for maximum matching in interval graphs.	IPPS	1995	DBLP DOI BibTeX RDF	disjoint intervals, maximum cardinality matchings, hypercube model, unsorted input, sorted input, optimal sequential algorithms, parallel algorithms, parallel algorithms, computational complexity, graph theory, hypercube networks, processors, computation time, interval graphs, maximum matching, EREW PRAM, EREW PRAM model
41	Thanh Minh Hoang	On the Matching Problem for Special Graph Classes.	CCC	2010	DBLP DOI BibTeX RDF	NC-computations, Perfect matchings, maximum matchings
33	Robert Franke, Ignaz Rutter, Dorothea Wagner	Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.	ISAAC	2009	DBLP DOI BibTeX RDF
33	Shankar Kalyanaraman, Christopher Umans	The Complexity of Rationalizing Matchings.	ISAAC	2008	DBLP DOI BibTeX RDF
33	Bing Tian Dai, Nick Koudas, Divesh Srivastava, Anthony K. H. Tung, Suresh Venkatasubramanian	Validating Multi-column Schema Matchings by Type.	ICDE	2008	DBLP DOI BibTeX RDF
33	Uffe Flarup, Laurent Lyaudet	On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract).	CSR	2008	DBLP DOI BibTeX RDF
33	Kurt Mehlhorn	Matchings in Graphs Variations of the Problem.	COCOA	2007	DBLP DOI BibTeX RDF
33	Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali	Simple deterministic approximation algorithms for counting matchings.	STOC	2007	DBLP DOI BibTeX RDF	correlation decay, matching, partition function, FPTAS
33	Andreas Björklund, Thore Husfeldt	Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.	ICALP (1)	2006	DBLP DOI BibTeX RDF
33	Mohammad Mahdian	Random popular matchings.	EC	2006	DBLP DOI BibTeX RDF	popular matching, matching, stable matching
33	Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer	Minimizing the stabbing number of matchings, trees, and triangulations.	SODA	2004	DBLP BibTeX RDF	stabbing number, complexity, matching, triangulation, spanning tree, crossing number, linear programming relaxation, iterated rounding
33	Steve Chien	A determinant-based algorithm for counting perfect matchings in a general graph.	SODA	2004	DBLP BibTeX RDF
33	Marcin Mucha, Piotr Sankowski	Maximum Matchings in Planar Graphs via Gaussian Elimination.	ESA	2004	DBLP DOI BibTeX RDF
33	Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji	Approximated Vertex Cover for Graphs with Perfect Matchings.	COCOON	2004	DBLP DOI BibTeX RDF
33	Peter Che Bor Lam, Heping Zhang	A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph.	Order	2003	DBLP DOI BibTeX RDF	Z-transformation graph, plane bipartite graph, poset, perfect matching, distributive lattice
33	Frédéric Gardi	Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems.	DMTCS	2003	DBLP DOI BibTeX RDF
33	M. Carmen Hernando, Ferran Hurtado, Marc Noy	Graphs of Non-Crossing Perfect Matchings.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
33	Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov	Tight Bounds on Maximal and Maximum Matchings.	ISAAC	2001	DBLP DOI BibTeX RDF
33	Jeff Kahn 0001	A Normal Law for Matchings.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C70, 05C65, 05B35, 60F05
33	Vijay V. Vazirani	NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems.	SWAT	1988	DBLP DOI BibTeX RDF
33	Andreas Brandstädt, Chính T. Hoàng	Maximum Induced Matchings for Chordal Graphs in Linear Time.	Algorithmica	2008	DBLP DOI BibTeX RDF	Maximum induced matchings, Perfect elimination order, Lexicographic breadth-first search, Chordal graphs, Linear time algorithm
33	Rajeev Motwani 0001	Average-Case Analysis of Algorithms for Matchings and Related Problems.	J. ACM	1994	DBLP DOI BibTeX RDF	average-case performance, factors, network flow, probabilistic analysis, maximum matchings, permanents
32	Gyula Pap	Weighted restricted 2-matching.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C70, 90C27
32	Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking	Uncoordinated two-sided matching markets.	EC	2008	DBLP DOI BibTeX RDF	better/best response dynamics, algorithmic game theory, stable marriage problem
32	Han Qin, Dejing Dou, Paea LePendu	Discovering Executable Semantic Mappings Between Ontologies.	OTM Conferences (1)	2007	DBLP DOI BibTeX RDF
32	Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf	The Polynomially Bounded Perfect Matching Problem Is in NC 2.	STACS	2007	DBLP DOI BibTeX RDF
32	Liangzhao Zeng, Boualem Benatallah, Guo Tong Xie, Hui Lei 0001	Semantic Service Mediation.	ICSOC	2006	DBLP DOI BibTeX RDF
32	Sandra Roger 0001, Agustina Buccella, Alejandra Cechich, Manuel Sanz Palomar	ASeMatch: A Semantic Matching Method.	TSD	2006	DBLP DOI BibTeX RDF
32	Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Xiaodong Wu 0001, Cedric X. Yu	Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy.	Algorithmica	2005	DBLP DOI BibTeX RDF	Leaf sequencing, Algorithms, Intensity-modulated radiation therapy
32	Jun-Seung Lee, Kyong-Ho Lee	XML Schema Matching Based on Incremental Ontology Update.	WISE	2004	DBLP DOI BibTeX RDF
32	Eduard C. Dragut, Ramon Lawrence	Composing Mappings Between Schemas Using a Reference Ontology.	CoopIS/DOA/ODBASE (1)	2004	DBLP DOI BibTeX RDF
32	Milena Mihail, Peter Winkler 0001	On the Number of Eularian Orientations of a Graph.	SODA	1992	DBLP BibTeX RDF
31	Gagan Aggarwal, S. Muthukrishnan 0001, Dávid Pál, Martin Pál	General auction mechanism for search advertising.	WWW	2009	DBLP DOI BibTeX RDF	sponsored search auctions, game theory, stable matchings
31	Domingos Moreira Cardoso, Marcin Kaminski 0001, Vadim V. Lozin	Maximum k -regular induced subgraphs.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Induced matchings, Graphs, Hamiltonian cycles, Independent sets
31	Stavros D. Nikolopoulos, Leonidas Palios	Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF	P4-sparse graphs, maximum-size subgraphs, perfect matching, maximum matchings, Perfect graphs, cographs
31	James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook	A Functional Approach to External Graph Algorithms.	Algorithmica	2002	DBLP DOI BibTeX RDF	Functional programming, Graph algorithms, Minimum spanning trees, Connected components, External memory algorithms, Maximal independent sets, Maximal matchings
31	Jaime Cohen, Claudio L. Lucchesi	Minimax relations for T-join packing problems.	ISTCS	1997	DBLP DOI BibTeX RDF	minimax relations, T-join packing problems, algorithmic results, structural results, minimum T-cut, maximization problem, theorem proving, polynomial time algorithm, perfect matchings, minimax techniques
25	Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski 0001	Ordered Unavoidable Sub-Structures in Matchings and Random Matchings.	Electron. J. Comb.	2024	DBLP DOI BibTeX RDF
25	Jian Wang 0092, Jie You	Extremal Problem for Matchings and Rainbow Matchings on Direct Products.	SIAM J. Discret. Math.	2023	DBLP DOI BibTeX RDF
25	Gergely Csáji	Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings.	CoRR	2023	DBLP DOI BibTeX RDF
25	Kenjiro Takazawa	Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
25	Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers	Understanding Popular Matchings via Stable Matchings.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
25	Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski	Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion.	ISAAC	2021	DBLP DOI BibTeX RDF
25	Simon Mauras	Analysis of random models for stable matchings. (Analyse de modèles aléatoires pour les matchings stables).		2021	RDF
25	Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath	Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness.	WG	2019	DBLP DOI BibTeX RDF
25	Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath	Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings.	CoRR	2018	DBLP BibTeX RDF
25	Kenjiro Takazawa	Excluded t-factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids.	CoRR	2017	DBLP BibTeX RDF
25	Girish Raguvir J, Rahul Ramesh, Sachin Sridhar, Vignesh Manoharan	AUPCR Maximizing Matchings : Towards a Pragmatic Notion of Optimality for One-Sided Preference Matchings.	CoRR	2017	DBLP BibTeX RDF
25	Kenjiro Takazawa	Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings.	IPCO	2017	DBLP DOI BibTeX RDF
25	Guilherme Dias da Fonseca, Bernard Ries, Diana Sasaki	On the ratio between maximum weight perfect matchings and maximum weight matchings in grids.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
25	Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza	Maximum induced matchings close to maximum matchings.	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
25	Yoshiteru Ishida, Takumi Satou	Characterization of Dynamics of Stable Matchings: Attractors Mapped from Stable Matchings.	KES	2013	DBLP DOI BibTeX RDF
25	Christine T. Cheng, Anhua Lin	Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings.	SIAM J. Discret. Math.	2011	DBLP DOI BibTeX RDF
25	Andreas Brandstädt, Raffaele Mosca	On distance-3 matchings and induced matchings.	Discret. Appl. Math.	2011	DBLP DOI BibTeX RDF
25	Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan	Some perfect matchings and perfect half-integral matchings in NC.	Chic. J. Theor. Comput. Sci.	2008	DBLP BibTeX RDF
25	Péter Biró 0001, Katarína Cechlárová, Tamás Fleiner	The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems.	Int. J. Game Theory	2008	DBLP DOI BibTeX RDF
25	Akihisa Tamura	Transformation from Arbitrary Matchings to Stable Matchings.	J. Comb. Theory, Ser. A	1993	DBLP BibTeX RDF
25	James B. Orlin	Dynamic matchings and quasidynamic fractional matchings. I.	Networks	1983	DBLP DOI BibTeX RDF
25	James B. Orlin	Dynamic matchings and quasidynamic fractional matchings. II.	Networks	1983	DBLP DOI BibTeX RDF
23	Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth	Disjoint compatible geometric matchings.	SCG	2011	DBLP DOI BibTeX RDF
23	Yunlong Liu 0001, Jianer Chen, Jianxin Wang 0001	On Counting 3-D Matchings of Size k.	Algorithmica	2009	DBLP DOI BibTeX RDF	3-D matching, Counting complexity, Approximation algorithm, Randomized algorithm, Parameterized algorithm
23	Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen	Improved Induced Matchings in Sparse Graphs.	IWPEC	2009	DBLP DOI BibTeX RDF
23	Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail 0001, Meghana Nasre	Bounded Unpopularity Matchings.	SWAT	2008	DBLP DOI BibTeX RDF
23	Arash Asadpour, Uriel Feige, Amin Saberi	Santa Claus Meets Hypergraph Matchings.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
23	Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001, Katarzyna E. Paluch 0001	Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	level maximal, Bipartite matching, strong stability, stable marriage
23	David Hartvigsen, Yanjun Li	Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract).	IPCO	2007	DBLP DOI BibTeX RDF
23	Benjamin Doerr, Daniel Johannsen	Adjacency list matchings: an ideal genotype for cycle covers.	GECCO	2007	DBLP DOI BibTeX RDF	randomized local, evolutionary algorithm, search, runtime analysis, cycle cover, Euler tour
23	Telikepalli Kavitha, Chintan D. Shah	Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems.	ISAAC	2006	DBLP DOI BibTeX RDF
23	Julián Mestre	Weighted Popular Matchings.	ICALP (1)	2006	DBLP DOI BibTeX RDF
23	Fitsum Admasu, Klaus D. Tönnies	Multi-scale Bayesian Based Horizon Matchings Across Faults in 3d Seismic Data.	DAGM-Symposium	2006	DBLP DOI BibTeX RDF
23	Jaap-Henk Hoepman, Shay Kutten, Zvi Lotker	Efficient Distributed Weighted Matchings on Trees.	SIROCCO	2006	DBLP DOI BibTeX RDF
23	Michael E. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo	Graphs of Triangulations and Perfect Matchings.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Non-crossing, Triangulation, Perfect matching