Search results for "separators"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
79	Rajiv Gupta 0001, Mary Lou Soffa, Denise Ombres	Efficient Register Allocation via Coloring Using Clique Separators.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	clique separators, node priorities, graph coloring, spans, spill code, interference graph
73	Jonathan A. Kelner	Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus.	STOC	2004	DBLP DOI BibTeX RDF	bounded genus, circle packing, partitioning, laplacian, graph separators, spectral partitioning
69	L. Sunil Chandran	A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph.	COCOON	2001	DBLP DOI BibTeX RDF
66	Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee	Improved approximation algorithms for minimum-weight vertex separators.	STOC	2005	DBLP DOI BibTeX RDF	vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings
64	Hasan Davulcu, Saikat Mukherjee, Arvind Seth, I. V. Ramakrishnan	CuTeX: a system for extracting data from text tables.	SIGIR	2002	DBLP DOI BibTeX RDF
56	Peifeng Xiang, Xin Yang, Yuanchun Shi	Effective Page Segmentation Combining Pattern Analysis and Visual Separators for Browsing on Small Screens.	Web Intelligence	2006	DBLP DOI BibTeX RDF
56	Rajiv Gupta 0001, Mary Lou Soffa, Tim Steele	Register Allocation via Clique Separators.	PLDI	1989	DBLP DOI BibTeX RDF
48	Hans L. Bodlaender, Udi Rotics	Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition.	SWAT	2002	DBLP DOI BibTeX RDF	minimum fill-in, minimal separators, graph algorithms, treewidth, Algorithms and data structures, modular decomposition
45	Frank Thomson Leighton, Satish Rao	An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms	FOCS	1988	DBLP DOI BibTeX RDF	max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation
44	Andreas Brandstädt, Chính T. Hoàng	On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem.	IPCO	2005	DBLP DOI BibTeX RDF
44	Rahul Santhanam	On Separators, Segregators and Time versus Space.	CCC	2001	DBLP DOI BibTeX RDF
44	Anne Berry, Jean Paul Bordat, Olivier Cogis	Generating All the Minimal Separators of a Graph.	WG	1999	DBLP DOI BibTeX RDF	Minimal Separator, Graph, Enumeration Algorithm
44	Hong Shen 0001, Keqin Li 0001, Si-Qing Zheng	Separators Are as Simple as Cutsets.	ASIAN	1999	DBLP DOI BibTeX RDF
44	Vincent Bouchitté, Ioan Todinca	Minimal Triangulations for Graphs with "Few" Minimal Separators.	ESA	1998	DBLP DOI BibTeX RDF
44	Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch	Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. (Erratum: ESA 1994: 508)	ESA	1993	DBLP DOI BibTeX RDF
44	Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto	Edge Separators for Planar Graphs and Their Applications.	MFCS	1988	DBLP DOI BibTeX RDF
40	Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis	Separators for sphere-packings and nearest neighbor graphs.	J. ACM	1997	DBLP DOI BibTeX RDF	centerpoint, rndomized algorithm, sphere-preserving mapping, computational geometry, partitioning, graph algorithms, probabilistic method, point location, graph separators
40	Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis	A Unified Geometric Approach to Graph Separators	FOCS	1991	DBLP DOI BibTeX RDF	randomized NC algorithms, geometric embedding, randomized linear time algorithms, k-overlap graphs, k-nearest neighbor graphs, separator bound, finite element methods, planar graphs, graph separators
38	Arthur Brady, Lenore Cowen	Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.	DISC	2006	DBLP DOI BibTeX RDF
38	Arthur Brady, Lenore Cowen	Compact routing with additive stretch using distance labelings.	SPAA	2006	DBLP DOI BibTeX RDF	compact routing
38	Martin Holzer 0001, Grigorios Prasinos, Frank Schulz 0001, Dorothea Wagner, Christos D. Zaroliagis	Engineering Planar Separator Algorithms.	ESA	2005	DBLP DOI BibTeX RDF
38	John C. Handley, Anoop M. Namboodiri, Richard Zanibbi	Document Understanding System Using Stochastic Context-Free Grammars.	ICDAR	2005	DBLP DOI BibTeX RDF
35	Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca	Independent Sets of Maximum Weight in Apple-Free Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF	clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
35	Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari	Partitioning planar graphs with costs and weights.	ACM J. Exp. Algorithmics	2006	DBLP DOI BibTeX RDF	graph partitioning algorithms, implementation, Graph algorithms, graph separators
35	Hans L. Bodlaender, Udi Rotics	Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition.	Algorithmica	2003	DBLP DOI BibTeX RDF	Minimum fill-in, Minimal separators, Graph algorithms, Treewidth, Polynomial algorithms, Modular decomposition
31	Bin Fu, Zhixiang Chen 0001	Sublinear time width-bounded separators and their application to the protein side-chain packing problem.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Width-bounded separator, Random sampling, Sublinear time algorithm
31	Uriel Feige, Mohammad Mahdian	Finding small balanced separators.	STOC	2006	DBLP DOI BibTeX RDF	fixed parameter tractability, VC dimension
31	Bin Fu, Zhixiang Chen 0001	Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem.	AAIM	2006	DBLP DOI BibTeX RDF
31	Anil Maheshwari, Norbert Zeh	I/O-optimal algorithms for planar graphs using separators.	SODA	2002	DBLP BibTeX RDF
31	Konstantin Skodinis	Efficient Analysis of Graphs with Small Minimal Separators.	WG	1999	DBLP DOI BibTeX RDF
31	Andreas Parra, Petra Scheffler	How to Use the Minimal Separators of a Graph for its Chordal Triangulation.	ICALP	1995	DBLP DOI BibTeX RDF
31	Ton Kloks, Dieter Kratsch	Finding All Minimal Separators of a Graph.	STACS	1994	DBLP DOI BibTeX RDF
31	R. Z. Hwang, Richard C. T. Lee	The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs.	ISAAC	1992	DBLP DOI BibTeX RDF
31	Ondrej Sýkora, Imrich Vrto	Edge Separators for Graphs of Bounded Genus with Applications.	WG	1991	DBLP DOI BibTeX RDF
31	Hillel Gazit, Gary L. Miller	Planar Separators and the Euclidean Norm.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
31	P. Sreenivasa Kumar, C. E. Veni Madhavan	A New Class of Separators and Planarity of Chordal Graphs.	FSTTCS	1989	DBLP DOI BibTeX RDF
26	Punyashloka Biswal, James R. Lee, Satish Rao	Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows.	FOCS	2008	DBLP DOI BibTeX RDF
26	Mohamed Didi Biha, Bangaly Kaba, Marie-Jean Meurs, Eric SanJuan	Graph Decomposition Approaches for Terminology Graphs.	MICAI	2007	DBLP DOI BibTeX RDF	polyhedral approach, topic vizualisation, text mining, graph algorithms, graph decomposition
26	Patrice Lefaucheur, Richard Nock	Robust Multiclass Ensemble Classifiers via Symmetric Functions.	ICPR (4)	2006	DBLP DOI BibTeX RDF	Symmetric functions, Ensemble classifiers
26	Matthias Kriesell	Closed Separator Sets.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C40
26	Egon Balas, Cid C. de Souza	The vertex separator problem: a polyhedral investigation.	Math. Program.	2005	DBLP DOI BibTeX RDF
26	Sariel Har-Peled, Vladlen Koltun	Separability with Outliers.	ISAAC	2005	DBLP DOI BibTeX RDF
26	Andreas Brandstädt, Van Bang Le, Suhail Mahfud	New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem.	FCT	2005	DBLP DOI BibTeX RDF
26	Lars Arge, Laura Toma	Simplified External Memory Algorithms for Planar DAGs.	SWAT	2004	DBLP DOI BibTeX RDF
26	Gary L. Miller, Peter C. Richter	Lower bounds for graph embeddings and combinatorial preconditioners.	SPAA	2004	DBLP DOI BibTeX RDF	congestion, preconditioning, dilation, graph embeddings
26	Sanjay Jain 0001, Frank Stephan 0001	Learning How to Separate.	ALT	2001	DBLP DOI BibTeX RDF
26	Vincent Bouchitté, Ioan Todinca	Listing All Potential Maximal Cliques of a Graph.	STACS	2000	DBLP DOI BibTeX RDF
26	Francesca Cesarini, Marco Gori, Simone Marinai, Giovanni Soda	Structured Document Segmentation and Representation by the Modified X-Y tree.	ICDAR	1999	DBLP DOI BibTeX RDF
26	Viet Hai Nguyen	A New Staircase Separator Theorem.	Euro-Par	1997	DBLP DOI BibTeX RDF
26	Antonie Azokly, Rolf Ingold	A language for document generic layout description and its use for segmentation into regions.	ICDAR	1995	DBLP DOI BibTeX RDF	document generic layout description language, generic layout description, region boundary delimiters, separator determination, segmentation method, page description languages
26	Juraj Hromkovic	Topology of Parallel Networks and Computational Complexity (Extended Abstract).	WG	1992	DBLP DOI BibTeX RDF
26	Angelika Zobel	Program structure as basis for parallelizing global register allocation.	ICCL	1992	DBLP DOI BibTeX RDF
26	Wiebren de Jonge, Peter Scheuermann, Ardie Schijf	Encoding and Manipulating Pictorial Data with S+-trees.	SSD	1991	DBLP DOI BibTeX RDF
22	Mohammad Ali Abam, Sariel Har-Peled	New constructions of SSPDs and their applications.	SCG	2010	DBLP DOI BibTeX RDF	separated pair decomposition, separators, geometric spanners
22	Jayanta Kumar Pal, Abhisek Saha	Identifying Themes in Social Media and Detecting Sentiments.	ASONAM	2010	DBLP DOI BibTeX RDF	Theme identification, Best Separators Algorithm, Singular Value Decomposition, Logistic Regression, Sentiment Analysis
22	Sanjeev Arora, Satish Rao, Umesh V. Vazirani	Expander flows, geometric embeddings and graph partitioning.	J. ACM	2009	DBLP DOI BibTeX RDF	Graph partitioning, semidefinite programs, multicommodity flows, expanders, expansion, graph separators
22	Minhua Huang, Robert M. Haralick	A Probabilistic Graphical Model for Recognizing NP Chunks in Texts.	ICCPOL	2009	DBLP DOI BibTeX RDF	NP chunking, graphical models, separators, cliques
22	David Steurer	Tight bounds for the Min-Max boundary decomposition cost of weighted graphs.	SPAA	2006	DBLP DOI BibTeX RDF	scheduling, load balancing, parallel computing, graph partitioning, graph separators
22	Christine Makowski, Lori L. Pollock	Achieving efficient register allocation via parallelism.	SAC	1995	DBLP DOI BibTeX RDF	cique separators, parallel register allocation, graph coloring
22	Philip N. Klein, Sairam Subramanian	A linear-processor polylog-time algorithm for shortest paths in planar graphs	FOCS	1993	DBLP DOI BibTeX RDF	linear-processor polylog-time algorithm, directed planar graphs, bounded-genus graphs, 2-dimensional overlap graphs, shortest paths, planar graphs, separators, decomposition tree
22	Hillel Gazit	A Deterministic Parallel Algorithm for Planar Graphs Isomorphism	FOCS	1991	DBLP DOI BibTeX RDF	processors count, deterministic parallel algorithm, planar graphs isomorphism, separators, running time
22	Baruch Awerbuch, David Peleg	Sparse Partitions (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	sparse partitions, polynomial routing, online tracking, locality-preserving representations, graph-theoretic structures, tree covers, diameter-based separators, protocols, clustering algorithms, covers, regional matchings, network applications, decomposition techniques, arbitrary networks, sparse spanners
18	Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa	On the hardness of inclusion-wise minimal separators enumeration.	Inf. Process. Lett.	2024	DBLP DOI BibTeX RDF
18	Rahul Jain 0015, Raghunath Tewari	Space efficient algorithm for solving reachability using tree decomposition and separators.	Theor. Comput. Sci.	2024	DBLP DOI BibTeX RDF
18	Matthew Daly	Remixing Music for Hearing Aids Using Ensemble of Fine-Tuned Source Separators.	CoRR	2024	DBLP DOI BibTeX RDF
18	Yoonjeong Park, Hyunjin Kim, Chanyeol Choi, Junseong Kim, Jy-yong Sohn	Can Separators Improve Chain-of-Thought Prompting?	CoRR	2024	DBLP DOI BibTeX RDF
18	Michael Blondin, Javier Esparza	Separators in Continuous Petri Nets.	Log. Methods Comput. Sci.	2024	DBLP DOI BibTeX RDF
18	Farzam Ebrahimnejad, James R. Lee	Non-Existence of Annular Separators in Geometric Graphs.	Discret. Comput. Geom.	2024	DBLP DOI BibTeX RDF
18	Jérôme Leroux	Ackermannian Completion of Separators.	FoSSaCS (1)	2024	DBLP DOI BibTeX RDF
18	Amit Prasad, Rahul Garg 0001, Yogish Sabharwal	Union of Convex Separators (UCS).	COMAD/CODS	2024	DBLP DOI BibTeX RDF
18	Gwenaël Joret, William Lochet, Michal T. Seweryn	Edge Separators for Graphs Excluding a Minor.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
18	Benito van der Zander, Maciej Liskiewicz, Johannes Textor	Corrigendum to "Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework" [Artif. Intell. 270 (2019) 1-40].	Artif. Intell.	2023	DBLP DOI BibTeX RDF
18	Yangming Zhou, Xiaze Zhang, Na Geng, Zhibin Jiang, Shouguang Wang, Mengchu Zhou	Frequent Itemset-Driven Search for Finding Minimal Node Separators and its Application to Air Transportation Network Analysis.	IEEE Trans. Intell. Transp. Syst.	2023	DBLP DOI BibTeX RDF
18	Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous	Clique-Based Separators for Geometric Intersection Graphs.	Algorithmica	2023	DBLP DOI BibTeX RDF
18	Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken	On finding separators in temporal split and permutation graphs.	J. Comput. Syst. Sci.	2023	DBLP DOI BibTeX RDF
18	Mouhamad El Joubbeh	Minimum Separators and Menger's Theorem.	Graphs Comb.	2023	DBLP DOI BibTeX RDF
18	Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa	On the hardness of inclusion-wise minimal separators enumeration.	CoRR	2023	DBLP DOI BibTeX RDF
18	Kirankumar Shiragur, Jiaqi Zhang, Caroline Uhler	Meek Separators and Their Applications in Targeted Causal Discovery.	CoRR	2023	DBLP DOI BibTeX RDF
18	Sirui Li, Wenbin Ouyang, Max B. Paulus, Cathy Wu 0002	Learning to Configure Separators in Branch-and-Cut.	CoRR	2023	DBLP DOI BibTeX RDF
18	Batya Kenig	Ranked Enumeration of Minimal Separators.	CoRR	2023	DBLP DOI BibTeX RDF
18	Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic	Bisimplicial separators.	CoRR	2023	DBLP DOI BibTeX RDF
18	Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov	Temporal Separators with Deadlines.	CoRR	2023	DBLP DOI BibTeX RDF
18	Marcin Pilipczuk, Pawel Rzazewski	A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number.	CoRR	2023	DBLP DOI BibTeX RDF
18	Jakob Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, Eva Rotenberg	Multilevel Skeletonization Using Local Separators.	CoRR	2023	DBLP DOI BibTeX RDF
18	Xiaolong Jia, Hongru Li, Huiping Guo	A recursive local search method of separators for Bayesian network decomposition structure learning algorithm.	Soft Comput.	2023	DBLP DOI BibTeX RDF
18	Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov	Temporal Separators with Deadlines.	ISAAC	2023	DBLP DOI BibTeX RDF
18	Peter Gartland, Daniel Lokshtanov	Graph Classes with Few Minimal Separators. II. A Dichotomy.	SODA	2023	DBLP DOI BibTeX RDF
18	Peter Gartland, Daniel Lokshtanov	Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs.	SODA	2023	DBLP DOI BibTeX RDF
18	Israel Cuevas, Victor M. Cárdenas, Homero Miranda-Vidales, Janeth Alcalá	Analysis and Evaluation of Phase-Sequence Separators for Sag Detection in Power Electronics Converter Applications.	CCE	2023	DBLP DOI BibTeX RDF
18	J. Andreas Bærentzen, Rasmus Emil Christensen, Emil Toftegaard Gæde, Eva Rotenberg	Multilevel Skeletonization Using Local Separators.	SoCG	2023	DBLP DOI BibTeX RDF
18	Kirankumar Shiragur, Jiaqi Zhang, Caroline Uhler	Meek Separators and Their Applications in Targeted Causal Discovery.	NeurIPS	2023	DBLP BibTeX RDF
18	Sirui Li, Wenbin Ouyang, Max B. Paulus, Cathy Wu 0002	Learning to Configure Separators in Branch-and-Cut.	NeurIPS	2023	DBLP BibTeX RDF
18	Chris Köcher, Georg Zetzsche	Regular Separators for VASS Coverability Languages.	FSTTCS	2023	DBLP DOI BibTeX RDF
18	Johannes Carmesin	Local 2-separators.	J. Comb. Theory, Ser. B	2022	DBLP DOI BibTeX RDF
18	Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic	Graphs with polynomially many minimal separators.	J. Comb. Theory, Ser. B	2022	DBLP DOI BibTeX RDF
18	Hendrik Molter	The complexity of finding temporal separators under waiting time constraints.	Inf. Process. Lett.	2022	DBLP DOI BibTeX RDF
18	On-Hei Solomon Lo, Jianguo Qian	Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
18	Frank Kammer, Johannes Meintrup, Andrej Sajenko	Space-Efficient Vertex Separators for Treewidth.	Algorithmica	2022	DBLP DOI BibTeX RDF
18	Michael Blondin, Javier Esparza	Separators in Continuous Petri Nets.	CoRR	2022	DBLP DOI BibTeX RDF
18	Blair L. Bilodeau, Linbo Wang, Daniel M. Roy 0001	Adaptively Exploiting d-Separators with Causal Bandits.	CoRR	2022	DBLP BibTeX RDF