↓ Skip to main content

Algorithm Theory - SWAT 2004

Overview of attention for book
Cover of 'Algorithm Theory - SWAT 2004'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Design and Analysis of Dynamic Multithreaded Algorithms
  3. Altmetric Badge
    Chapter 2 Cache-Oblivious Algorithms and Data Structures
  4. Altmetric Badge
    Chapter 3 Getting the Best Response for Your Erg
  5. Altmetric Badge
    Chapter 4 Auctions with Budget Constraints
  6. Altmetric Badge
    Chapter 5 Tight Approximability Results for Test Set Problems in Bioinformatics
  7. Altmetric Badge
    Chapter 6 Robust Subgraphs for Trees and Paths
  8. Altmetric Badge
    Chapter 7 Collective Tree Spanners of Graphs
  9. Altmetric Badge
    Chapter 8 Optimally Competitive List Batching
  10. Altmetric Badge
    Chapter 9 The Relative Worst Order Ratio Applied to Seat Reservation
  11. Altmetric Badge
    Chapter 10 Online Maintenance of k-Medians and k-Covers on a Line
  12. Altmetric Badge
    Chapter 11 Matching Polyhedral Terrains Using Overlays of Envelopes
  13. Altmetric Badge
    Chapter 12 Algorithm Theory - SWAT 2004
  14. Altmetric Badge
    Chapter 13 Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
  15. Altmetric Badge
    Chapter 14 Construction of the Nearest Neighbor Embracing Graph of a Point Set
  16. Altmetric Badge
    Chapter 15 Connectivity of Graphs Under Edge Flips
  17. Altmetric Badge
    Chapter 16 Improvement of Nemhauser-Trotter Theorem and its applications in parametrized complexity
  18. Altmetric Badge
    Chapter 17 A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
  19. Altmetric Badge
    Chapter 18 Railway Delay Management: Exploring Its Algorithmic Complexity
  20. Altmetric Badge
    Chapter 19 Layered Heaps
  21. Altmetric Badge
    Chapter 20 Melding Priority Queues
  22. Altmetric Badge
    Chapter 21 An Algorithm for Cyclic Edge Connectivity of Cubic Graphs
  23. Altmetric Badge
    Chapter 22 Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices
  24. Altmetric Badge
    Chapter 23 New Algorithms for Enumerating All Maximal Cliques
  25. Altmetric Badge
    Chapter 24 The Multi-multiway Cut Problem
  26. Altmetric Badge
    Chapter 25 The Bottleneck Problem with Minimum Quantity Commitments
  27. Altmetric Badge
    Chapter 26 All-Norm Approximation for Scheduling on Identical Machines
  28. Altmetric Badge
    Chapter 27 Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler
  29. Altmetric Badge
    Chapter 28 Approximation Schemes for the Crane Scheduling Problem
  30. Altmetric Badge
    Chapter 29 Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems
  31. Altmetric Badge
    Chapter 30 A ( $2 - c\frac{{\rm log} N}{N}$ )–Approximation Algorithm for the Stable Marriage Problem
  32. Altmetric Badge
    Chapter 31 Maximizing the Number of Packed Rectangles
  33. Altmetric Badge
    Chapter 32 Two Space Saving Tricks for Linear Time LCP Array Computation
  34. Altmetric Badge
    Chapter 33 Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles
  35. Altmetric Badge
    Chapter 34 Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks
  36. Altmetric Badge
    Chapter 35 Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
  37. Altmetric Badge
    Chapter 36 The Optimal Online Algorithms for Minimizing Maximum Lateness
  38. Altmetric Badge
    Chapter 37 Power Assignment in Radio Networks with Two Power Levels
  39. Altmetric Badge
    Chapter 38 Pointed Binary Encompassing Trees
  40. Altmetric Badge
    Chapter 39 On Geometric Structure of Global Roundings for Graphs and Range Spaces
  41. Altmetric Badge
    Chapter 40 External Connected Components
  42. Altmetric Badge
    Chapter 41 Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
  43. Altmetric Badge
    Chapter 42 Simplified External Memory Algorithms for Planar DAGs
Attention for Chapter 23: New Algorithms for Enumerating All Maximal Cliques
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
69 Mendeley
citeulike
2 CiteULike
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
New Algorithms for Enumerating All Maximal Cliques
Chapter number 23
Book title
Algorithm Theory - SWAT 2004
Published by
Springer, Berlin, Heidelberg, July 2004
DOI 10.1007/978-3-540-27810-8_23
Book ISBNs
978-3-54-022339-9, 978-3-54-027810-8
Authors

Kazuhisa Makino, Takeaki Uno, Makino, Kazuhisa, Uno, Takeaki

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 69 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Germany 1 1%
Australia 1 1%
Brazil 1 1%
Canada 1 1%
Taiwan 1 1%
Unknown 64 93%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 22 32%
Researcher 13 19%
Student > Master 10 14%
Student > Bachelor 4 6%
Professor > Associate Professor 3 4%
Other 4 6%
Unknown 13 19%
Readers by discipline Count As %
Computer Science 41 59%
Engineering 5 7%
Mathematics 3 4%
Agricultural and Biological Sciences 3 4%
Materials Science 2 3%
Other 2 3%
Unknown 13 19%