Search results for "length-bounded"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
45	Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella	Length-Bounded Cuts and Flows.	ICALP (1)	2006	DBLP DOI BibTeX RDF
39	Maren Martens, Martin Skutella	Length-Bounded and Dynamic k-Splittable Flows.	OR	2005	DBLP DOI BibTeX RDF
33	Sanjay Jain 0001, Arun Sharma 0001	Mind Change Complexity of Learning Logic Programs.	EuroCOLT	1999	DBLP DOI BibTeX RDF
21	Stephen A. Cook, Bruce M. Kapron	Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	finite type functional, simple typed while-programming language, mu -recursion, feasible functionals, length-bounded, bounded typed loop program, run times
16	Marta Arias, Roni Khardon	The Subsumption Lattice and Query Learning.	ALT	2004	DBLP DOI BibTeX RDF
15	César Luis Alonso, Fátima Drubi, Judith Gómez-García, José Luis Montaña	Word Equation Systems: The Heuristic Approach.	SBIA	2004	DBLP DOI BibTeX RDF	local search strategies, genetic algorithms, Evolutionary computation, word equations
15	Raed Alharbi, Lan N. Nguyen, My T. Thai	Continuous Length-Bounded Paths Interdiction.	CSoNet	2023	DBLP DOI BibTeX RDF
15	Matthias Bentert, Klaus Heeger, Dusan Knop	Length-bounded cuts: Proper interval graphs and structural parameters.	J. Comput. Syst. Sci.	2022	DBLP DOI BibTeX RDF
15	Lan N. Nguyen, My T. Thai	Length-Bounded Paths Interdiction in Continuous Domain for Network Performance Assessment.	CoRR	2020	DBLP BibTeX RDF
15	Matthias Bentert, Klaus Heeger, Dusan Knop	Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters.	ISAAC	2020	DBLP DOI BibTeX RDF
15	Eden Chlamtác, Petr Kolman	How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut.	APPROX-RANDOM	2020	DBLP DOI BibTeX RDF
15	Matthias Bentert, Klaus Heeger, Dusan Knop	Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters.	CoRR	2019	DBLP BibTeX RDF
15	Alan Kuhnle, Victoria G. Crawford, My T. Thai	Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees.	Proc. ACM Meas. Anal. Comput. Syst.	2018	DBLP DOI BibTeX RDF
15	Junran Lichen, Jianping Li 0007, Ko-Wei Lih	Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces.	Inf. Process. Lett.	2018	DBLP DOI BibTeX RDF
15	Pavel Dvorák, Dusan Knop	Parameterized Complexity of Length-bounded Cuts and Multicuts.	Algorithmica	2018	DBLP DOI BibTeX RDF
15	Alan Kuhnle, Victoria G. Crawford, My T. Thai	Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees.	SIGMETRICS (Abstracts)	2018	DBLP DOI BibTeX RDF
15	Pavel A. Borisovsky, Anton V. Eremeev, Sergei Hrushev, Vadim Teplyakov, Mikhail Vorozhtsov	Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths.	CoRR	2017	DBLP BibTeX RDF
15	Keehang Kwon, Dae-Seong Kang	Towards a Decidable LogicWeb via Length-Bounded Derivations.	CoRR	2017	DBLP BibTeX RDF
15	Yi-Shan Lin, Chun-Liang Lee, Yaw-Chung Chen	Length-Bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection.	Algorithms	2017	DBLP DOI BibTeX RDF
15	Donatella Granata, Antonino Sgalambro	Network Interdiction through Length-Bounded Critical Disruption Paths: a Bi-Objective Approach.	Electron. Notes Discret. Math.	2016	DBLP DOI BibTeX RDF
15	Yi-Shan Lin, Chun-Liang Lee, Yaw-Chung Chen	Length-bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection.	ICNCC	2016	DBLP DOI BibTeX RDF
15	Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems.	ICALP	2016	DBLP DOI BibTeX RDF
15	Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems.	CoRR	2015	DBLP BibTeX RDF
15	Dusan Knop, Pavel Dvorak	Parameterized complexity of length-bounded cuts and multi-cuts.	CoRR	2015	DBLP BibTeX RDF
15	Pavel Dvorak, Dusan Knop	Parametrized Complexity of Length-Bounded Cuts and Multi-cuts.	TAMC	2015	DBLP DOI BibTeX RDF
15	Jannik Matuschke, Andreas Bley, Benjamin Müller 0002	Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections.	ESA	2013	DBLP DOI BibTeX RDF
15	Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella	Length-bounded cuts and flows.	ACM Trans. Algorithms	2010	DBLP DOI BibTeX RDF
15	Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang	Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph.	J. Comput. Syst. Sci.	2010	DBLP DOI BibTeX RDF
15	Michael B. Baer	Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding	CoRR	2006	DBLP BibTeX RDF
15	Hein van der Holst, José Coelho de Pina	Length-bounded disjoint paths in planar graphs.	Discret. Appl. Math.	2002	DBLP DOI BibTeX RDF
15	Takeshi Shinohara	Rich Classes Inferable from Positive Data: Length-Bounded Elementary Formal Systems	Inf. Comput.	1994	DBLP DOI BibTeX RDF
14	Manfred Kunde, Kay Guertzig	Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length.	IPPS	1997	DBLP DOI BibTeX RDF
11	Santosh S. Vempala	Random Projection: A New Approach to VLSI Layout.	FOCS	1998	DBLP DOI BibTeX RDF
10	Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari	The Cent-dian Path Problem on Tree Networks.	ISAAC	2001	DBLP DOI BibTeX RDF	median path, centre path, facility location
9	Yuval Ishai, Anat Paskin	Evaluating Branching Programs on Encrypted Data.	TCC	2007	DBLP DOI BibTeX RDF
9	César Luis Alonso, Fátima Drubi, José Luis Montaña	An Evolutionary Algorithm for Solving Word Equation Systems.	CAEPIA	2003	DBLP DOI BibTeX RDF
9	Eunseuk Oh, Jong-Seok Kim, Hyeong-Ok Lee	Fault-Tolerant Routing in Mesh-Connected 2D Tori.	International Conference on Computational Science	2003	DBLP DOI BibTeX RDF
9	Jianer Chen, Guojun Wang 0001, Songqiao Chen	Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	fault tolerance, Interconnection network, hypercube, routing algorithm
9	Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu	Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing.	WG	1991	DBLP DOI BibTeX RDF	line digraph iteration, diameter vulnerability, k-diameter, fault tolerance, graph, connectivity, container, de Bruijn graph, spread, Kautz graph
9	Christos Levcopoulos, Andrzej Lingas	Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees.	Optimal Algorithms	1989	DBLP DOI BibTeX RDF
9	Paul Chew	There is a Planar Graph Almost as Good as the Complete Graph.	SCG	1986	DBLP DOI BibTeX RDF
6	Bin Fu, Yumei Huo, Hairong Zhao	Makespan Minimization with Machine Availability Constraints.	COCOA	2009	DBLP DOI BibTeX RDF	machine availability constraints, makespan, PTAS, inapproximation
6	Rui Huang, Gergely V. Záruba	Static Path Planning for Mobile Beacons to Localize Sensor Networks.	PerCom Workshops	2007	DBLP DOI BibTeX RDF
6	Lisa Fleischer, Martin Skutella	The Quickest Multicommodity Flow Problem.	IPCO	2002	DBLP DOI BibTeX RDF
6	Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman	Algorithms for fault-tolerant routing in circuit switched networks.	SPAA	2002	DBLP DOI BibTeX RDF	flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths
6	Marcus Hutter	Towards a Universal Theory of Artificial Intelligence Based on Algorithmic Probability and Sequential Decisions.	ECML	2001	DBLP DOI BibTeX RDF
6	Jochen Meßner	On Optimal Algorithms and Optimal Proof Systems.	STACS	1999	DBLP DOI BibTeX RDF
6	J. Howard Johnson	Rational Equivalence Relations.	ICALP	1986	DBLP DOI BibTeX RDF