user avatar
user avatar
user avatar
Joseph Malkevitch
  • Member for 11 years, 10 months
  • Last seen more than 2 years ago
18 votes

Conjectures implying Four Color Theorem

12 votes

Social choice, arrow's theorem and open problems ?

9 votes
Accepted

Projective Plane of Order 12

8 votes

Counting the number of Hamiltonian cycles in cubic Hamiltonian graphs?

7 votes

Why does the Fibonacci sequence produce a worst-case Huffman encoding?

6 votes
Accepted

What's the complexity of this estate-division game?

6 votes

About properties of adjacency matrix when a graph is planar

6 votes

Edge-partitioning cubic graphs into claws and paths

5 votes

What is a really good problem to get your hands dirty in computational-geometry?

5 votes

graphs from real-life problems

4 votes

Using error-correcting codes in theory

4 votes

Algorithmic game theory - nonstandard equilibrium concepts?

4 votes

Complexity of edge coloring in planar graphs

3 votes

What is known about solutions to sparse integer linear programming problems?

3 votes

Can we partition NP-complete problem into finite number of polynomially solvable problems?

3 votes

Classes of graphs with easy Hamiltonian cycle but NP-hard TSP

2 votes

Complexity of counting m-cycles in a graph with n nodes

2 votes

Simple and practical deterministic algorithm, complicated running time

2 votes

Is any chordal graph an incomparability graph?

2 votes

Decomposition of edges of eulerian graph into maximum number of cycles

2 votes

Upper bounds on the length of longest simple path in non-Hamiltonian graph?

2 votes

polygonal triangulation and 3-colorability

2 votes

What are the main sub-areas of theoretical computer science?

1 vote

Polynomial time approximation algorithms for machine scheduling: how many open problems are left?

1 vote

Counting complexity of a scheduling problem.

1 vote

Is there any other algorithm whose worst-case running time is exponential meanwhile it works very well in practice other than Simplex Algorithm?

1 vote

What is the maximum number of stable marriages for an instance of the Stable Marriage Problem?

0 votes

Applications of Hamiltonian Cycle Problem

0 votes

Resources on Jablon's Protocol

0 votes

Complexity of the Hamiltonian Subcycle problem