Search results for "Search tree algorithms"

Found 15 publication records. Showing 15 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Graph modification, Search tree algorithms, Automated development and analysis of algorithms, Exact algorithms, NP-hard problems, Algorithm engineering
2	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Automated Generation of Search Tree Algorithms for Graph Modification Problems.	ESA	2003	DBLP DOI BibTeX RDF
1	Peter Damaschke	Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF
1	Henning Fernau, Daniel Raible	Searching Trees: An Essay.	TAMC	2009	DBLP DOI BibTeX RDF
1	Jussi Kujala, Tapio Elomaa	The cost of offline binary search tree algorithms and the complexity of the request sequence.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Federico Della Croce, Vangelis Th. Paschos	Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.	Operational Research	2008	DBLP DOI BibTeX RDF	Dominance conditions, Set covering, Max cut, Worst-case complexity
1	Michael Dom, Jiong Guo, Rolf Niedermeier	Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.	TAMC	2007	DBLP DOI BibTeX RDF
1	Faisal N. Abu-Khzam	Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
1	Henning Fernau	Parameterized Algorithms for Hitting Set: The Weighted Case.	CIAC	2006	DBLP DOI BibTeX RDF
1	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
1	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.	CIAC	2003	DBLP DOI BibTeX RDF	edge modification problems, data clustering, NP-complete problems, exact algorithms, fixed-parameter tractability
1	Richard E. Ladner, Ray Fortna, Bao-Hoang Nguyen	A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation.	Experimental Algorithmics	2000	DBLP DOI BibTeX RDF
1	Sabine Hanke	The Performance of Concurrent Red-Black Tree Algorithms.	Algorithm Engineering	1999	DBLP BibTeX RDF
1	Adrian Colbrook, Eric A. Brewer, Chrysanthos Dellarocas, William E. Weihl	Algorithms for Search Trees on Message-Passing Architectures.	IEEE Trans. Parallel Distrib. Syst.	1996	DBLP DOI BibTeX RDF	Balanced search trees, dictionary abstract data type, query throughput, query response time, parallel algorithms, message-passing architectures, linear processor array
1	G. Michael Barnes, Gary A. Kind	Visual simulations of data structures during lecture.	SIGCSE	1987	DBLP DOI BibTeX RDF