Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 (Q1572590): Difference between revisions

Latest revision as of 12:30, 30 May 2024

scientific article

Language	Label	Description	Also known as
English	Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998	scientific article

Statements

instance of

scholarly article

0 references

title

Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 (English)

0 references

zbMATH Open document ID

0940.00071

0 references

published in

Theoretical Computer Science

0 references

publication date

12 July 2000

0 references

full work available at URL

https://www.sciencedirect.com/science/article/pii/S0304397599001796/pdf

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Special issue

0 references

Festschrift

0 references

Selected papers

0 references

Theoretical computer science

0 references

Hong Kong

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

0 references

The bandwidth problem for graphs and matrices—a survey

0 references

Graphs with small bandwidth and cutwidth

0 references

Q5596082

0 references

Q4231911

0 references

Q4542524

0 references

Complexity Results for Bandwidth Minimization

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Q5185900

0 references

Geometric algorithms and combinatorial optimization

0 references

Bandwidth Minimization: An approximation algorithm for caterpillars

0 references

Approximating the bandwidth for asteroidal triple-free graphs

0 references

The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete

0 references

Q4324980

0 references

The NP-completeness of the bandwidth minimization problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1572590

@@ Property / cites work @@
+Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
+Normal rank
@@ Property / cites work @@
+The bandwidth problem for graphs and matrices—a survey
+Normal rank
@@ Property / cites work @@
+Graphs with small bandwidth and cutwidth
@@ Property / cites work: Graphs with small bandwidth and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q5596082
@@ Property / cites work: Q5596082 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231911
@@ Property / cites work: Q4231911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542524
@@ Property / cites work: Q4542524 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Results for Bandwidth Minimization
@@ Property / cites work: Complexity Results for Bandwidth Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q5185900
@@ Property / cites work: Q5185900 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Bandwidth Minimization: An approximation algorithm for caterpillars
+Normal rank
@@ Property / cites work @@
+Approximating the bandwidth for asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank