yusuke1997/dblp-id-title huggingface dataset:
Multicast server architectures for supporting IP multicast over ATM
An Implementation of a Gateway for Hierarchically Encoded Video Across ATM and IP Networks
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
A Rate Control Mechanism for LAN/MAN Interworking Systems
On the integration of the UMTS and B-ISDN system
Performance Analysis of the demand priority LAN
High Performance Networking IV, Proceedings of the IFIP TC6/WG6.4 Fourth International Conference on High Performance Networking, Liège, Belgium, 14-18 December, 1992
Integrating Parallel Computing Applications in an ATM Scenario
Enhanced Convolution Approach for Connection Admission Control in ATM Networks
Description of a Simulation Environment to Evaluate High Performance ATM Fast Packet Switches
Performance issues in implementing a portable SMDS server
Development of a MPEG data stream characterization for use with ATM networks
Transport Layer Multicast: An Enhancement for XTP Bucket Error Control
A distributed route-selection scheme for establishing real-time channels
TCP-BFA: Buffer Fill Avoidance
Flow control in ATM based local area networks
Meeting end-to-end QoS challenges for scalable flows in heterogeneous multimedia environments
System Support for distributed multimedia applications with guaranteed quality of service
Supporting timing and requirements of digital video and audio in desktop conferencing systems
Scheduling Algorithms for Advance Resource Reservation
On End-to-End Congestion Avoidance for TCP/IP
Application level framing and automated implementation
A Dynamic Sender-Initiated Reservation Protocol for the Internet
A Host Interface Architecture for High-Speed Networks
A Performance Study of the XTP Error Control
Performance analysis of the dual cell spacer in ATM systems
Experiences with the Heidelberg Multimedia Communication System: Multicast, Rate Enforcement and Performance
Fast Rerouting in ATM Networks: Pro-Active Search Protocol
Feedback Controlled Scheduling for QoS in Communication Systems
Multimedia Mail Services
A High-Speed Protocol Parallel Implementation: Design and Analysis
The OSI 95 Connection-Mode Transport Service: The Enhanced QoS
Orchestra!: An Internet Service for Distributed Musical Sessions and Collaborative Music Development and Engineering
A Source Model for Connectionless Traffic in B-ISDN
SELDOM: A Simple and Efficient Low-cost, Delay-bounded, Online Multicasting
Adaptive variation of reliability
An end-to-end mechanism for jitter control in multimedia services
Design and implementation of a flexible traffic controller for ATM connections
A Scalability Scheme for the Real-time Control Protocol
A New Reservation Scheme for CRMA High-Speed Networks
A new congestion control framework for large bandwidth-delay product networks
An architecture for active networking
High Performance Networking, IFIP TC-6 Eigth International Conference on High Performance Networking (HPN'98), Vienna, Austria, September 21-25, 1998
Analysis of a new end-to-end proportional bandwidth allocation algorithm
Parallel TCP/IP for Multiprocessor Workstations
Center placement algorithms for large multicast groups
Protocol-, operating system- and ATM layer-limitations in practical performance analysis of UDP/IP and TCP/IP over ATM
Quality of Service Negotiation for Orchestrated, Distributed Mulitmedia Presentation
Dynamic routing based on a single parameter: link congestion probability
Fast Connection Establishment in the DTM Gigabit Network
Measuring the behaviour of a world-wide web server
Dynamic Bandwidth Allocation and Access Control of Virtual Paths in ATM Broadband Networks
Orchestration Services for Distributed Multimedia Synchronisation
A simulation study of a wireless bandwidth reservation multiple access protocol for multimedia traffic
A New HFC Architecture Using Return Path Multiplexing
A Comparison of Gigabit Router Architectures
Nondeterministic Classifier Performance Evaluation for Flow Based IP Switching
Flow Management in a Quality of Service Architectures
Throughout optimization for multimedia applications over high speed networks
A framework for ATM testing
Internet QoS Routing Using the Bellman-Ford Algorithm
Performance Analysis of Window-based Flow Control Using TCP/IP: Effect of High Bandwidth-Delay Products and Random Loss
TCP/IP on the Parallel Protocol Engine
Architectures for Interworking between B-ISDN and Frame Relay
End-to-End Reliable Multicast Transport Protocol Adaptation for Floor Control and Other Conference Control Functions Requirements
High Performance Networking VII, IFIP TC6 Seventh International Conference on High Performance Networking (HPN'97), White Plains, New York, USA, 28th April - 2nd May 1997
FDDI Performance Evaluation Based on LOTOS Formal Description Tecnique
USD: Scalable Bandwidth Allocation for the Internet
Automatic Network Clustering for Fast Path Selection
Efficient configuration of protocol software for multiprocessors
Interconnection of LANs/802.6 Customer Premises Equipments (CPEs) via SMDS on Top of ATM: A Case Description
The Network Computer for an Open Services Market
An Architecture for Conference-Support Using Secured Multicast
Wireles LAN emulation over ATM networks
ISO OSI FTAM and High Speed File Transfer: No Contradiction
Performance Issues in Designing Network Interfaces: A Case Study
The strategy of traffic dispersion
Motivation of an End-to-end Regulation of Bandwidth in Intranetworks: The ROBIN Concept
Performance evaluations of partial order connections
Client-Network Interactions in Quality of Service Communication Environments
A Rate Based Back-Pressure Flow Control for the Internet
Analysis of Traffic Measurements in the VISTAnet Gigabit Networking Testbed
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
Addressing and Routing in Heterogeneous Data Networks
Multicast Provision for High Speed Networks
Optimising Bandwidth Reservation in IP/ATM Internetworks Using the Guaranteed Delay Service
Behaviour of the Metaring Gigabit/s Network under Multipriority Traffic
QoS: From Definition to Management
Active Libraries: A Flexible Strategy for Active Networks
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs
Collision-Free Network Exploration
LATIN '95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings
Factoring in Skew-Polynomial Rings
Myhill-Nerode Theorem for Recognizable Tree Series Revisited
Theoretical Analysis of git bisect
Measurement Errors Make the Partial Digest Problem NP-Hard
LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings
Approximating the Expressive Power of Logics in Finite Models
Automata and Pattern Matching in Planar Directed Acyclic Graphs
An Improved Communication-Randomness Tradeo
On Some Subclasses of Split B 1 -EPG Graphs
The Anti-Oberwolfach Solution: Pancyclic 2- Factorizations of Complete Graphs
The Read/Write Protocol Complex Is Collapsible
Arithmetic Circuits for Discrete Logarithms
Emerging Behavior as Binary Search Trees Are Symmetrically Updated
LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings
Bandwidth of Bipartite Permutation Graphs in Polynomial Time
Mutants and Residents with Different Connection Graphs in the Moran Process
A Middle Curve Based on Discrete Fréchet Distance
Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time
Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank
Indexed Multi-pattern Matching
Edge Insertion for Optional Triangulations
Efficient Algorithms for Computing a Minimal Homology Basis
Lower Bounds for Clear Transmissions in Radio Networks
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
The Complexity of Finding Top-Toda-Equivalence-Class Members
Competitive Algorithms for Demand Response Management in Smart Grid
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
Parallel Complexity of Heaps and Min-Max Heaps
Compressed Indexing with Signature Grammars
Tree Compression Using String Grammars
Cut Problems in Graphs with a Budget Constraint
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration
On Using Learning Automata for Fast Graph Partitioning
Collective Additive Tree Spanners of Homogeneously Orderable Graphs
A Tight Bound for Shortest Augmenting Paths on Trees
Complex Polynomials and Circuit Lower Bounds for Modular Counting
Coloring Geometric Range Spaces
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
Colorful Strips
Computing the Degeneracy of Large Graphs
Short and Smooth Polygonal Paths
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses
Logspace Computations in Graph Groups and Coxeter Groups
Erdős Magic
Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs
Packing Problems with Orthogonal Rotations
Edge-Editing to a Dense and a Sparse Graph Class
Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities
A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees
Generalized Shannon Code Minimizes the Maximal Redundancy
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers
The LCA Problem Revisited
Probabilistically Faulty Searching on a Half-Line - (Extended Abstract)
A Geometric Approach to the Bisection Method
Even Induced Cycles in Planar Graphs
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
The Hardness of Sampling Connected Subgraphs
Emergence of Wave Patterns on Kadanoff Sandpiles
Solution of a Problem of Yekutieli and Mandelbrot
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
Cache Oblivious Sparse Matrix Multiplication
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
L(2, 1)-Coloring Matrogenic Graphs
Combinatorics of Beacon-Based Routing in Three Dimensions
Prize-Collecting Steiner Networks via Iterative Rounding
Testing and Checking of Finite State Systems
Generating Signed Permutations by Twisting Two-Sided Ribbons
Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions
Computing in the Presence of Concurrent Solo Executions
Separating Codes: Constructions and Bounds
List Update with Locality of Reference
Run Statistics for Geometrically Distributed Random Variables (Extended Abstract)
Tractable Unordered 3-CNF Games
Graph Structure of the Web: A Survey
Tight Approximations of Degeneracy in Large Graphs
Kernelization through Tidying
Faster Information Gathering in Ad-Hoc Radio Tree Networks
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
Analyzing Glauber Dynamics by Comparison of Markov Chains
Sharp Estimates for the Main Parameters of the Euclid Algorithm
Counting Fixed Points and Pure 2-Cycles of Tree Cellular Automata
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
Exponential-Time Quantum Algorithms for Graph Coloring Problems
Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering
On the Planar Split Thickness of Graphs
Network Flow Spanners
Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries
Random Walks and Bisections in Random Circulant Graphs
A Rewrite Approach for Constraint Logic Programming
Asymptotic (a)Synchronism Sensitivity and Complexity of Elementary Cellular Automata
The Size and Depth of Layered Boolean Circuits
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields
Automata for Arithmetic Meyer Sets
Faster Non-linear Parametric Search with Applications to Optimazation and Dynamic Geometry
Minimum Latency Tours and the k-Traveling Repairmen Problem
Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings
An Architecture for Provably Secure Computation
A Temporal Logic for Real-Time Partial-Ordering with Named Transactions
On Vertex Guarding Staircase Polygons
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game
Random Partial Match in Quad-K-d Trees
Some Observations on Holographic Algorithms
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
Bichromatic 2-Center of Pairs of Points
Finding the Best CAFE Is NP-Hard
O(n) Time Algorithms for Dominating Induced Matching Problems
Plane Gossip: Approximating Rumor Spread in Planar Graphs
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line
Encoding Homotopy of Paths in the Plane
Computation of the Bisection Width for Random d-Regular Graphs
Lower Bounds for Modular Counting by Circuits with Modular Gates
Degree-Constrained Node-Connectivity
Local Routing Algorithms on Euclidean Spanners with Small Diameter
Approximation Algorithms for the Max-Buying Problem with Limited Supply
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n
A Theory and Algorithms for Combinatorial Reoptimization
Pattern Matching Statistics on Correlated Sources
Sparse Recovery Using Sparse Random Matrices
Bases for Non-homogeneous Polynomial C k Splines on the Sphere
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines
Bi-arc Digraphs: Recognition Algorithm and Applications
Integer Factorization and Discrete Logarithms (Abstract)
The Online Freeze-Tag Problem
Pattern Matching and Membership for Hierarchical Message Sequence Charts
Helly-Type Theorems in Property Testing
Design and Analysis of Online Batching Systems
Flips in Higher Order Delaunay Triangulations
Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract
Edge Colouring Reduced Indifference Graphs
Shape Reconstruction with Delaunay Complex
Randomised Broadcasting: Memory vs. Randomness
Self-complementary (Pseudo-)Split Graphs
Wheeler Maps
A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion
Layered Working-Set Trees
An Equivariance Theorem with Applications to Renaming
Robust Model-Checking of Linear-Time Properties in Timed Automata
MCSP is Hard for Read-Once Nondeterministic Branching Programs
Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices
Multi-parameter Minimum Spanning Trees
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
Distributed Games and Distributed Control for Asynchronous Systems
An Algorithm That Builds a Set of Strings Given Its Overlap Graph
Improved Exact Algorithms for MAX-SAT
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
Quantum Cryptanalysis of Hash and Claw-Free Functions
Property Suffix Array with Applications
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
Verification of Embedded Reactive Fiffo Systems
LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part II
Approximate Matching of Network Expressions with Spacers
Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees
Parallel Repetition of the Odd Cycle Game
Common Deadline Lazy Bureaucrat Scheduling Revisited
Approximation Schemes for a Class of Subset Selection Problems
PTAS for Steiner Tree on Map Graphs
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
Shifting the Phase Transition Threshold for Random Graphs Using Degree Set Constraints
Fast Set Intersection and Two-Patterns Matching
Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness
Finding Skew Partitions Efficiently
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles
Complexity of Cycle Length Modularity Problems in Graphs
Almost k -Wise Independence and Hard Boolean Functions
Agglomerative Clustering of Growing Squares
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
How Expressions Can Code for Automata
Approximating Maximum Diameter-Bounded Subgraphs
Lower Bounds for Geometric Diameter Problems
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
Improved Tree Decomposition Based Algorithms for Domination-like Problems
Sparsity in Covering Solutions
(Probabilistic) Recurrence Realtions Revisited
An Improved Data Stream Algorithm for Clustering
Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities
Competitive Cost Sharing with Economies of Scale
On the Bend-Number of Planar and Outerplanar Graphs
On Counting Perfect Matchings in General Graphs
Searching in Random Partially Ordered Sets
Rank Selection in Multidimensional Data
On Edge-Colouring Indifference Graphs
Asymptotics for Push on the Complete Graph
O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations
The Generalized Median Stable Matchings: Finding Them Is Not That Easy
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
On the Complexity of Some Problems for the Blum, Shub & Smale Model
Another View of the Gaussian Algorithm
Rational Function Decomposition and Gröbner Bases in the Parameterization of Plane Curves (An extended abstract)
Two-Dimensional Range Diameter Queries
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
Graph Square Roots of Small Distance from Degree One Graphs
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
Lightweight Data Indexing and Compression in External Memory
Leaders Election Without Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs
On Dynamical Properties of Generalized Toggle Automata
Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs
Server Scheduling in the Weighted l p Norm
RISOTTO: Fast Extraction of Motifs with Mismatches
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits
Almost Optimal Proper Learning and Testing Polynomials
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs
Majority Model on Random Regular Graphs
Randomly Colouring Graphs with Girth Five and Large Maximum Degree
Beta-Expansions for Cubic Pisot Numbers
Pipeline Transportation of Petroleum Products with No Due Dates
LZ77-Based Self-indexing with Faster Pattern Matching
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
Weakly Iterated Block Products of Finite Monoids
Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Packet Routing on the Grid
Pseudorandom Graphs from Elliptic Curves
Convexity in Partial Cubes: The Hull Number
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number
Circuits Constructed with MOD q Gates Cannot Compute AND in Sublinear Size
Solving NP-Complete Problems with Quantum Search
On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications
Mobile Agent Rendezvous in a Synchronous Torus
On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)
Partitioning Orthogonal Histograms into Rectangular Boxes
NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets
A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem
On Quadratic Threshold CSPs
Free Shuffle Algebras in Language Varieties (Extended Abstract)
Weighted Rectilinear Approximation of Points in the Plane
Off-Line Electronic Cash Based on Secret-Key Certificates
The Net Automaton of a Rational Expression
Competitive Analysis of Scheduling Algorithms for Aggregated Links
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
(k, n-k)-Max-Cut: An 𝒪 ∗ (2 p )-Time Algorithm and a Polynomial Kernel
Steiner Trees for Hereditary Graph Classes
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs
Transition Operations over Plane Trees
The Complexity Classes of Hamming Distance Recoverable Robust Problems
Characterising Strong Normalisation for Explicit Substitutions
The I/O Complexity of Computing Prime Tables
I/O-Efficient Point Location in a Set of Rectangles
On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm
Universal Statistical Tests
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems
Analysis of the Continued Logarithm Algorithm
Simple Approximation Algorithms for Balanced MAX 2SAT
On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering Structures
Matching Based Augmentations for Approximating Connectivity Problems
Sampling Grid Colorings with Fewer Colors
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?
Modelling Errors and Recovery for Communication
Random Generation of Colored Trees
Rank Inequalities for Packing Designs and Sparse Triple Systems
Classical Computability and Fuzzy Turing Machines
Longest Repeats with a Block of Don't Cares
RNA Molecules: Glimpses Through an Algorithmic Lens
Cost-Optimal Trees for Ray Shooting
Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions
The Geometry of Browsing
Small Maximal Matchings in Random Graphs
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization
Property Testing for Point Sets on the Plane
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions
LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings
Tree 3-Spanners on Generalized Prisms of Graphs
Comparing and Aggregating Partially Resolved Trees
On Approximate Colored Path Counting
Cyclic Automata Networks on Finite Graphs
Parameterized Approximation Algorithms for Weighted Vertex Cover
Hardness of Variants of the Graph Coloring Game
Rectilinear Convex Hull of Points in 3D
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems
Cache Me If You Can: Capacitated Selfish Replication Games
Space-Efficient Conversions from SLPs
Combinatorial Problems on Strings with Applications to Protein Folding
LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I
Density Classification on Infinite Lattices and Trees
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
Directed Ear Anonymity
Lower Bounds for Testing Complete Positivity and Quantum Separability
Multihead Two-Way probabilistic Finite Automata
Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function
Radix Cross-Sections for Length Morphisms
A Divide and Conquer Method to Compute Binomial Ideals
On the (Im)possibility of Non-interactive Correlation Distillation
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Maximizing Happiness in Graphs of Bounded Clique-Width
A Collection of Lower Bounds for Online Matching on the Line
Facility Location Constrained to a Polygonal Domain
Faster Combinatorial k-Clique Algorithms
(Total) Vector Domination for Graphs with Bounded Branchwidth