↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Collision-Free Routing Problem with Restricted L-Path
  3. Altmetric Badge
    Chapter 2 Linear Clique-Width of Bi-complement Reducible Graphs
  4. Altmetric Badge
    Chapter 3 Linear Ramsey Numbers
  5. Altmetric Badge
    Chapter 4 Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)
  6. Altmetric Badge
    Chapter 5 Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families
  7. Altmetric Badge
    Chapter 6 Minimum Polygons for Fixed Visibility VC-Dimension
  8. Altmetric Badge
    Chapter 7 Minsum k -Sink Problem on Dynamic Flow Path Networks
  9. Altmetric Badge
    Chapter 8 Fully Leafed Induced Subtrees
  10. Altmetric Badge
    Chapter 9 Pattern Matching for k -Track Permutations
  11. Altmetric Badge
    Chapter 10 Approximation Algorithms for the p -Hub Center Routing Problem in Parameterized Metric Graphs
  12. Altmetric Badge
    Chapter 11 On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees
  13. Altmetric Badge
    Chapter 12 A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
  14. Altmetric Badge
    Chapter 13 Covering with Clubs: Complexity and Approximability
  15. Altmetric Badge
    Chapter 14 On the Expected Number of Distinct Gapped Palindromic Factors
  16. Altmetric Badge
    Chapter 15 Computational Complexity of Robot Arm Simulation Problems
  17. Altmetric Badge
    Chapter 16 Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation
  18. Altmetric Badge
    Chapter 17 Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
  19. Altmetric Badge
    Chapter 18 An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
  20. Altmetric Badge
    Chapter 19 Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem
  21. Altmetric Badge
    Chapter 20 On the Parameterized Complexity of Colorful Components and Related Problems
  22. Altmetric Badge
    Chapter 21 Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols
  23. Altmetric Badge
    Chapter 22 Zero-Suppression and Computation Models
  24. Altmetric Badge
    Chapter 23 The Crossing Number of Seq-Shellable Drawings of Complete Graphs
  25. Altmetric Badge
    Chapter 24 Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning
  26. Altmetric Badge
    Chapter 25 Placing Segments on Parallel Arcs
  27. Altmetric Badge
    Chapter 26 Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem
  28. Altmetric Badge
    Chapter 27 LZ-ABT: A Practical Algorithm for $$\alpha $$ -Balanced Grammar Compression
  29. Altmetric Badge
    Chapter 28 Faster Coreset Construction for Projective Clustering via Low-Rank Approximation
  30. Altmetric Badge
    Chapter 29 Separating Interaction Effects Using Locating and Detecting Arrays
  31. Altmetric Badge
    Chapter 30 An Efficient Representation of Partitions of Integers
  32. Altmetric Badge
    Chapter 31 How Far From a Worst Solution a Random Solution of a $$k\,$$ CSP Instance Can Be?
Attention for Chapter 12: A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
Altmetric Badge

Mentioned by

twitter
2 X users

Readers on

mendeley
4 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
Chapter number 12
Book title
Combinatorial Algorithms
Published in
arXiv, July 2018
DOI 10.1007/978-3-319-94667-2_12
Book ISBNs
978-3-31-994666-5, 978-3-31-994667-2
Authors

Christine Dahn, Nils M. Kriege, Petra Mutzel, Dahn, Christine, Kriege, Nils M., Mutzel, Petra

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 50%
Professor 1 25%
Unknown 1 25%
Readers by discipline Count As %
Computer Science 1 25%
Engineering 1 25%
Unknown 2 50%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 31 May 2018.
All research outputs
#19,519,579
of 24,002,307 outputs
Outputs from arXiv
#589,022
of 1,011,770 outputs
Outputs of similar age
#256,991
of 330,163 outputs
Outputs of similar age from arXiv
#17,683
of 23,340 outputs
Altmetric has tracked 24,002,307 research outputs across all sources so far. This one is in the 10th percentile – i.e., 10% of other outputs scored the same or lower than it.
So far Altmetric has tracked 1,011,770 research outputs from this source. They receive a mean Attention Score of 4.0. This one is in the 25th percentile – i.e., 25% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 330,163 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 12th percentile – i.e., 12% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 23,340 others from the same source and published within six weeks on either side of this one. This one is in the 12th percentile – i.e., 12% of its contemporaries scored the same or lower than it.