4. Computer Science
  5. Discrete Mathematics

Marcin Kaminski

Computer Science – Discrete Mathematics

Scientist

Rate now
  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientist

Contracting planar graphs to contractions of triangulations

Mathematics – Combinatorics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Deciding k-colourability of $P_5$-free graphs in polynomial time

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Max-Cut and Max-Bisection are NP-hard on unit disk graphs

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Polynomial-time algorithm for vertex k-colorability of P_5-free graphs

Computer Science – Discrete Mathematics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Shortest paths between shortest paths and independent sets

Computer Science – Computational Complexity
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Marcin Kaminski does not yet have a rating. At this time, there are no reviews or comments for this scientist.

If you have personal experience with Marcin Kaminski, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Marcin Kaminski will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-P-72795

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.

Canada

 Charities
 Companies
 MP Candidates
 Patents
 Employee Salary Disclosure

World

 Places of the World
 Scientific Papers

United States

 Banks
 Companies
 Counties
 Patents
 Employee Salary Disclosure