ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
36
views
19
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
324
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computing and Combinatorics
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
other
Author(s):
Jiří Fiala
,
Tomáš Gavenčiak
,
Dušan Knop
,
Martin Koutecký
,
Jan Kratochvíl
Publication date
(Online):
July 20 2016
Publisher:
Springer International Publishing
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH title and first author match)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
2021 Research and Innovation Open Distance and eLearning Virtual Conference
Most cited references
19
Record
: found
Abstract
: not found
Article
: not found
Integer Programming with a Fixed Number of Variables
H. W. Lenstra
(1983)
0
comments
Cited
180
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Upper bounds to the clique width of graphs
Bruno Courcelle
,
Stephan Olariu
(2000)
0
comments
Cited
118
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
An application of simultaneous diophantine approximation in combinatorial optimization
András Frank
,
Eva Tardos
(1987)
0
comments
Cited
49
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
July 20 2016
Pages
: 67-78
DOI:
10.1007/978-3-319-42634-1_6
SO-VID:
8866cd64-42a4-44d8-ab21-9e4a96c60958
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Clairvoyant Mechanisms for Online Auctions
pp. 15
Truthfulness for the Sum of Weighted Completion Times
pp. 27
Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
pp. 39
New Results for Network Pollution Games
pp. 55
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
pp. 67
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
pp. 79
A Parameterized Algorithm for Bounded-Degree Vertex Deletion
pp. 92
The Monotone Circuit Value Problem with Bounded Genus Is in NC
pp. 105
Locality-Sensitive Hashing Without False Negatives for $$l_p$$
pp. 119
Improved Space Efficient Algorithms for BFS, DFS and Applications
pp. 131
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio
pp. 143
Frequent-Itemset Mining Using Locality-Sensitive Hashing
pp. 159
On the Hardness of Switching to a Small Number of Edges
pp. 171
On Hard Instances of Non-Commutative Permanent
pp. 182
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model
pp. 194
Minimum Cost Homomorphisms with Constrained Costs
pp. 209
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
pp. 222
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
pp. 235
Balls and Funnels: Energy Efficient Group-to-Group Anycasts
pp. 247
Assigning Proximity Facilities for Gatherings
pp. 257
Combiners for Chosen-Ciphertext Security
pp. 269
Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes
pp. 281
Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits
pp. 293
Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
pp. 307
The Routing of Complex Contagion in Kleinberg’s Small-World Networks
pp. 319
The Maximum Disjoint Routing Problem
pp. 330
Balanced Allocation on Graphs: A Random Walk Approach
pp. 345
On the Power of Simple Reductions for the Maximum Independent Set Problem
pp. 357
Deterministic Algorithms for Unique Sink Orientations of Grids
pp. 370
From Graph Orientation to the Unweighted Maximum Cut
pp. 385
Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
pp. 393
Decomposing Cubic Graphs into Connected Subgraphs of Size Three
pp. 405
Automorphisms of the Cube $$n^d$$
pp. 417
Hadwiger’s Conjecture and Squares of Chordal Graphs
pp. 431
Minimum Width Color Spanning Annulus
pp. 443
Computing a Minimum-Width Square or Rectangular Annulus with Outliers
pp. 455
Approximating the Maximum Rectilinear Crossing Number
pp. 468
An Improved Approximation Algorithm for rSPR Distance
pp. 483
Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine
pp. 496
Complex-Demand Scheduling Problem with Application in Smart Grid
pp. 510
From Preemptive to Non-preemptive Scheduling Using Rejections
pp. 520
Flow Shop for Dual CPUs in Dynamic Voltage Scaling
pp. 535
Algorithms for k-median Clustering over Distributed Streams
pp. 547
Polygon Simplification by Minimizing Convex Corners
pp. 560
Combinatorial Scoring of Phylogenetic Networks
pp. 573
Highly Bi-Connected Subgraphs for Computational Protein Function Annotation
pp. 587
Cost Register Automata for Nested Words
pp. 599
Extending MSVL with Semaphore
pp. 611
Satisfiability of Linear Time Mu-Calculus on Finite Traces
pp. 623
On the Complexity of Insertion Propagation with Functional Dependency Constraints
Similar content
324
Planning multiple movements within a fixed time limit: the cost of constrained time allocation in a visuo-motor task.
Authors:
Hang Zhang
,
Shih-Wei Wu
,
Laurence T. Maloney
Vulnerability and Efficiency Assessment of Complex Power Grids Using Current-Flow Line Centralities
Authors:
Somnath Maity
,
Premananda Panigrahi
Safety and tolerability of aripiprazole for irritability in pediatric patients with autistic disorder: a 52-week, open-label, multicenter study.
Authors:
Daniel R. Marcus
,
Robert Findling
,
R McQuade
…
See all similar
Cited by
1
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
Authors:
Dušan Knop
,
Martin Koutecký
,
Tomáš Masařík
…
See all cited by