Search results for "bipartite"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang 0053	Improved Algorithms for Bicluster Editing.	TAMC	2008	DBLP DOI BibTeX RDF
15	Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume	A Black Hen Lays White Eggs.	CARDIS	2008	DBLP DOI BibTeX RDF	double-size technique, RSA, smartcard, Montgomery multiplication, efficient implementation
15	C. Greg Plaxton	Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines.	ICALP (1)	2008	DBLP DOI BibTeX RDF
15	Stefano Crespi-Reghizzi, Pierluigi San Pietro	Consensual Definition of Languages by Regular Sets.	LATA	2008	DBLP DOI BibTeX RDF
15	Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela	Tight Local Approximation Results for Max-Min Linear Programs.	ALGOSENSORS	2008	DBLP DOI BibTeX RDF
15	Gilles Brassard, André Allan Méthot	Strict Hierarchy of Bell Theorems.	ICQNM	2008	DBLP DOI BibTeX RDF	Bell theorem, Bell theorem without inequalities, Pseudo-telepathy, Entanglement
15	Martin Fürer, Shiva Prasad Kasiviswanathan	Approximately Counting Embeddings into Random Graphs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
15	Pim van 't Hof, Daniël Paulusma	A New Characterization of P6-Free Graphs.	COCOON	2008	DBLP DOI BibTeX RDF
15	Sadish Sadasivam, Huaming Zhang	On Representation of Planar Graphs by Segments.	AAIM	2008	DBLP DOI BibTeX RDF
15	Peter Hui, Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic	Train Tracks and Confluent Drawings.	Algorithmica	2007	DBLP DOI BibTeX RDF
15	Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos	Time slot scheduling of compatible jobs.	J. Sched.	2007	DBLP DOI BibTeX RDF	Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling
15	Piotr Sankowski	Faster dynamic matchings and vertex connectivity.	SODA	2007	DBLP BibTeX RDF
15	Nicholas J. A. Harvey	An algebraic algorithm for weighted linear matroid intersection.	SODA	2007	DBLP BibTeX RDF
15	Luciana S. Buriol, Gereon Frahling, Stefano Leonardi 0001, Christian Sohler	Estimating Clustering Indexes in Data Streams.	ESA	2007	DBLP DOI BibTeX RDF
15	Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan	Planarity, Determinants, Permanents, and (Unique) Matchings.	CSR	2007	DBLP DOI BibTeX RDF
15	Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf	The Polynomially Bounded Perfect Matching Problem Is in NC 2.	STACS	2007	DBLP DOI BibTeX RDF
15	Bing Bai, Paul B. Kantor, Ali Shokoufandeh, Deborah Silver	fMRI Brain Image Retrieval Based on ICA Components.	ENC	2007	DBLP DOI BibTeX RDF
15	Jianxin Wang 0001, Xiaoshuang Xu, Yunlong Liu 0001	An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem.	COCOA	2007	DBLP DOI BibTeX RDF
15	Luca Trevisan	Fun with Sub-linear Time Algorithms.	FUN	2007	DBLP DOI BibTeX RDF
15	Tim Paulden, David K. Smith 0002	From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality.	IEEE Trans. Evol. Comput.	2006	DBLP DOI BibTeX RDF
15	Poompat Saengudomlert, Eytan H. Modiano, Robert G. Gallager	On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks.	IEEE/ACM Trans. Netw.	2006	DBLP DOI BibTeX RDF	graph theory, routing and wavelength assignment, WDM networks
15	Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli	Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C17
15	Mohammad R. Salavatipour	Large Induced Forests in Triangle-Free Planar Graphs.	Graphs Comb.	2006	DBLP DOI BibTeX RDF
15	Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki	Matching Algorithms Are Fast in Sparse Random Graphs.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
15	Mark E. O'Sullivan	Algebraic construction of sparse matrices with large girth.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
15	Daniela Kühn, Deryk Osthus	Critical chromatic number and the complexity of perfect packings in graphs.	SODA	2006	DBLP DOI BibTeX RDF
15	Michael P. McGarry, Martin Reisslein, Violet R. Syrotiuk	Access control in heterogeneous multichannel wireless networks.	InterSense	2006	DBLP DOI BibTeX RDF
15	Nicholas J. A. Harvey	Algebraic Structures and Algorithms for Matching and Matroid Problems.	FOCS	2006	DBLP DOI BibTeX RDF
15	Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei-Ying Ma	Event detection from evolution of click-through data.	KDD	2006	DBLP DOI BibTeX RDF	dynamic web, evolution pattern, event detection, click-through data
15	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß	Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments.	CIAC	2006	DBLP DOI BibTeX RDF
15	Benjamin Doerr	Generating Randomized Roundings with Cardinality Constraints and Derandomizations.	STACS	2006	DBLP DOI BibTeX RDF
15	Andris Ambainis, Robert Spalek	Quantum Algorithms for Matching and Network Flows.	STACS	2006	DBLP DOI BibTeX RDF
15	Barnaby Martin, Florent R. Madelaine	Towards a Trichotomy for Quantified H-Coloring.	CiE	2006	DBLP DOI BibTeX RDF
15	Boaz Barak, Anup Rao 0001, Ronen Shaltiel, Avi Wigderson	2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.	STOC	2006	DBLP DOI BibTeX RDF	independent sources, extractors, dispersers, Ramsey graphs
15	Julia Chuzhoy, Sanjeev Khanna	Hardness of cut problems in directed graphs.	STOC	2006	DBLP DOI BibTeX RDF	directed multicut, hardness of approximation, sparsest cut
15	Rajeev Motwani 0001, Rina Panigrahy, Ying Xu 0002	Fractional Matching Via Balls-and-Bins.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
15	Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter	Applying Modular Decomposition to Parameterized Bicluster Editing.	IWPEC	2006	DBLP DOI BibTeX RDF	edge modification problems, bicluster graphs, NP-complete problems, fixed-parameter tractability, cluster graphs
15	Daniel H. Ho, Shahrokh Valaee	Information Raining and Optimal Link-Layer Design for Mobile Hotspots.	IEEE Trans. Mob. Comput.	2005	DBLP DOI BibTeX RDF	mobile hotspots, graph theory, linear programming, wireless communication, medium access control, network protocols, constrained optimization, Emerging technologies, mobile environments, combinatorial algorithms, mobile communication systems, graphs and networks, network architecture and design
15	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
15	Hiroshi Nagamochi	An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
15	J. Orestes Cerdeira, Leonor Santiago Pinto	Requiring Connectivity in the Set Covering Problem.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	integer polytopes, graphs, set covering, connected components
15	Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan	Simultaneous Matchings.	ISAAC	2005	DBLP DOI BibTeX RDF
15	Gek Ling Chia, V. L. Chia	On the Choice Numbers of Some Complete Multipartite Graphs.	CJCDGCGT	2005	DBLP DOI BibTeX RDF
15	Noga Alon, Asaf Shapira, Benny Sudakov	Additive Approximation for Edge-Deletion Problems.	FOCS	2005	DBLP DOI BibTeX RDF
15	Sriram V. Pemmaraju, Rajiv Raman 0001	Approximation Algorithms for the Max-coloring Problem.	ICALP	2005	DBLP DOI BibTeX RDF
15	Jan-Jan Wu, Pangfeng Liu	Distributed Scheduling of Parallel I/O in the Presence of Data Replication.	IPDPS	2005	DBLP DOI BibTeX RDF
15	Jianyong Duan, Yi Hu, Ruzhan Lu, Yan Tian, Hui Liu 0002	Bilingual Semantic Network Construction.	ICIC (2)	2005	DBLP DOI BibTeX RDF
15	Kazuhiro Kazama, Osamu Katai, Shin-ya Sato, Hiroshi Kawakami	Web Community Discovery Using Personal Names.	WIRI	2005	DBLP DOI BibTeX RDF
15	Natwar Modani, Yogish Sabharwal, S. Karthik	A Framework for Session Based Recommendations.	EC-Web	2005	DBLP DOI BibTeX RDF
15	Ran Raz	Extractors with weak random seeds.	STOC	2005	DBLP DOI BibTeX RDF	random sources, extractors, pseudorandomness, condensers, mergers, randomness extraction, explicit constructions, Ramsey graphs
15	Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson	Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors.	STOC	2005	DBLP DOI BibTeX RDF	dispersers condenser, constructions, extractors, explicit, ramsey graphs
15	Jonathan S. K. Chan, Victor O. K. Li, King-Shan Lui	Scheduling algorithms for peer-to-peer collaborative file distribution.	CollaborateCom	2005	DBLP DOI BibTeX RDF
15	C. A. Rodger	Hamilton Decomposable Graphs with Specified Leaves.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
15	Andreas Goerdt, André Lanka	On the Hardness and Easiness of Random 4-SAT Formulas.	ISAAC	2004	DBLP DOI BibTeX RDF
15	Feodor F. Dragan, Irina Lomonosov	On Compact and Efficient Routing in Certain Graph Classes.	ISAAC	2004	DBLP DOI BibTeX RDF
15	Marcin Mucha, Piotr Sankowski	Maximum Matchings via Gaussian Elimination.	FOCS	2004	DBLP DOI BibTeX RDF
15	Hui Jiang 0002, Chong-Wah Ngo	Graph Based Image Matching.	ICPR (3)	2004	DBLP DOI BibTeX RDF
15	Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki	Matching Algorithms Are Fast in Sparse Random Graphs.	STACS	2004	DBLP DOI BibTeX RDF
15	Arvind Gupta, Ján Manuch, Ladislav Stacho	Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.	SIROCCO	2004	DBLP DOI BibTeX RDF
15	Noga Alon, Vera Asodi	Edge Coloring with Delays.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
15	Andrej Bogdanov, Luca Trevisan	Lower Bounds for Testing Bipartiteness in Dense Graphs.	CCC	2004	DBLP DOI BibTeX RDF
15	Chingren Lee, Jenq Kuen Lee, TingTing Hwang, Shi-Chun Tsai	Compiler optimization on VLIW instruction scheduling for low power.	ACM Trans. Design Autom. Electr. Syst.	2003	DBLP DOI BibTeX RDF	VLIW instruction scheduling, instruction bus optimizations, low-power optimization, Compilers
15	Zhenhong Liu, Jianzhong Zhang 0001	On Inverse Problems of Optimum Perfect Matching.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	maximum-mean alternating cycle, ellipsoid method, linear programming, perfect matching, strongly polynomial algorithm, maximum-weight matching
15	Alex R. Berg, Tibor Jordán	Algorithms for Graph Rigidity and Scene Analysis.	ESA	2003	DBLP DOI BibTeX RDF
15	Luisa Gargano, Mikael Hammar	There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them).	ICALP	2003	DBLP DOI BibTeX RDF	Graph theory, Graph and network algorithms
15	Farn Wang, Hsu-Chun Yen	Timing Parameter Characterization of Real-Time Systems.	CIAA	2003	DBLP DOI BibTeX RDF
15	Cécile Murat, Vangelis Th. Paschos	The Probabilistic Minimum Coloring Problem.	WG	2003	DBLP DOI BibTeX RDF
15	Dariusz Dereniowski, Marek Kubale	Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.	PPAM	2003	DBLP DOI BibTeX RDF
15	Sandrine Lanquetin, Sebti Foufou, Hamamache Kheddouci, Marc Neveu	A Graph Based Algorithm for Intersection of Subdivision Surfaces.	ICCSA (3)	2003	DBLP DOI BibTeX RDF
15	Andreas Huck, Eberhard Triesch	Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C65, 05C70
15	Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos	Weighted Node Coloring: When Stable Sets Are Expensive.	WG	2002	DBLP DOI BibTeX RDF
15	Leslie Ann Goldberg, Steven Kelk, Mike Paterson	The complexity of choosing an H-colouring (nearly) uniformly at random.	STOC	2002	DBLP DOI BibTeX RDF
15	Zsolt Tuza, Annegret Wagler	Minimally Non-Preperfect Graphs of Small Maximum Degree.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
15	Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovsky	New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout.	ASP-DAC	2001	DBLP DOI BibTeX RDF
15	Kurt Mehlhorn, Guido Schäfer	A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.	ESA	2001	DBLP DOI BibTeX RDF
15	Amit Chakrabarti, Subhash Khot	Improved Lower Bounds on the Randomized Complexity of Graph Properties.	ICALP	2001	DBLP DOI BibTeX RDF	Decision tree complexity, monotone graph properties, randomized complexity, graph packing, randomized algorithms, probabilistic method
15	Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel	Lower Bounds for Approximation Algorithms for the Steiner Tree Problem.	WG	2001	DBLP DOI BibTeX RDF
15	Chuan-Ching Sue, Sy-Yen Kuo	Restoration from Multiple Faults in WDM Networks without Wavelength Conversion.	ICN (1)	2001	DBLP DOI BibTeX RDF
15	Eldar Fischer, Ilan Newman	Testing of matrix properties.	STOC	2001	DBLP DOI BibTeX RDF	matrix properties, property testing
15	Erich Prisner	Bicliques in Graphs I: Bounds on Their Number.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C
15	Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang	Efficient Minus and Signed Domination in Graphs.	ISAAC	2000	DBLP DOI BibTeX RDF
15	Tsuyoshi Murata	Discovery of Web Communities Based on the Co-Occurence of References.	Discovery Science	2000	DBLP DOI BibTeX RDF
15	Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya	On Double Bound Graphs with Respect to Graph Operations.	JCDCG	2000	DBLP DOI BibTeX RDF
15	Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry	Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs.	STACS	2000	DBLP DOI BibTeX RDF
15	Bruno Courcelle	Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas.	RTA	1999	DBLP DOI BibTeX RDF
15	Don Coppersmith, Gregory B. Sorkin	Constructive Bounds and Exact Expectations for the Random Assignment Problem.	RANDOM	1998	DBLP DOI BibTeX RDF
15	David P. DiVincenzo, Christopher A. Fuchs, Hideo Mabuchi, John A. Smolin, Ashish V. Thapliyal, Armin Uhlmann	Entanglement of Assistance.	QCQC	1998	DBLP DOI BibTeX RDF
15	Yachyang Sun, Ting-Chi Wang, Chak-Kuen Wong, C. L. Liu 0001	Routing for symmetric FPGAs and FPICs.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
15	Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho	Hamiltonian-Laceability of Star Graphs.	ISPAN	1997	DBLP DOI BibTeX RDF
15	Alon Efrat, Matthew J. Katz	Computing Fair and Bottleneck Matchings in Geormetric Graphs.	ISAAC	1996	DBLP DOI BibTeX RDF
15	Kazuo Murota	Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-Mcmillan form at infinity and structural indices in Kronecker form.	Appl. Algebra Eng. Commun. Comput.	1995	DBLP DOI BibTeX RDF	combinatorial matrix theory, Kronecker form of matrix pencil, Smith-McMillan form of rational matrix, matching, determinant, computer algebra, polyhedral combinatorics
15	Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri	Can Visibility Graphs be Represented Compactly?	SCG	1993	DBLP DOI BibTeX RDF
15	W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee	Minimum rectangular partition problem for simple rectilinear polygons.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
15	János Pach, Richard Pollack, Emo Welzl	Weaving Patterns of Lines and Segments in Space.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
15	Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert	Predicting fill for sparse orthogonal factorization.	J. ACM	1986	DBLP DOI BibTeX RDF
14	Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano	Directed Tree Networks.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Bipartite edge coloring, Approximation algorithms, Optical networks, Path coloring
14	David Eppstein	Testing bipartiteness of geometric intersection graphs.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Hopcroft's problem, coin graph, geometric thickness, graph coloring, minimum spanning tree, Bipartite graph, line segments, disks, intersection graph
14	Stéphan Clémençon, Marine Depecker, Nicolas Vayatis	Bagging Ranking Trees.	ICMLA	2009	DBLP DOI BibTeX RDF	Bipartite ranking, ROC optimization, consensus ranking, decision trees, bagging, rank aggregation
14	Tao Zhou 0001	Personal Recommendation in User-Object Networks.	Complex (1)	2009	DBLP DOI BibTeX RDF	Infophysics, User-Object Networks, Diffusion, Personal Recommendation, Bipartite Networks
14	Gagan Raj Gupta, Sujay Sanghavi, Ness B. Shroff	Node weighted scheduling.	SIGMETRICS/Performance	2009	DBLP DOI BibTeX RDF	scheduling, switch, bipartite matching, fluid limits