Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Eldar Fischer
Information about the author Eldar Fischer will soon be added to the site.
Found
2 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Hardness and algorithms for rainbow connection
2011
An edge‐colored graph G is rainbow connected if any two vertices are connected...
Testing Convexity Properties of Tree Colorings
2011
A coloring of a graph is convex if it induces a partition of the vertices into...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
