NEWS
New Feature!!!! University Subject Rankings in 12 branches
FOR SCIENTIST REGISTRATION FOR INSTITUTIONAL BULK REGISTRATION
FOR EDIT YOUR UNIVERSITY / INSTITUTION PAGE
Some differences of the AD Scientific Index
New Feature!!!! University Subject Rankings in 12 branches
List without CERN, Statistical Data etc. Only in AD Scientific Index
New Feature!!!! University Subject Rankings in 12 branches
AD
Scientific Index 2024
About Us
Methodology
Compare & Choose
Contact - FAQ
login
Login
person_add
Register
insights
i10 Productivity Rankings
format_list_numbered
Citation Rankings
school
University Rankings
subject
University Subject Rankings
insights
Subject Rankings
place
Country Rankings
format_list_numbered
Top 100 Scientists
format_quote
Top 100 Institutions
local_fire_department
Country Top Lists
Daniel Paulusma
Durham University - Durham / United Kingdom
Engineering & Technology / Computer Science
AD Scientific Index ID: 4364655
Edit Form
Registration, Add Profile,
Premium Membership
Ranking &
Analysis
Job
Experiences (0)
Education
Information (0)
Published Books (0)
Book Chapters (0)
Articles (0)
Presentations (0)
Lessons (0)
Projects (0)
Congresses (0)
Editorship, Referee &
Scientific Board (0 )
Patents /
Designs (0)
Academic Grants
& Awards (0)
Artistic
Activities (0)
Certificate / Course
/ Trainings (0)
Association &
Society Memberships (0)
Contact, Office
& Social Media
person_outline
Daniel Paulusma's MOST POPULAR ARTICLES
1-)
A survey on the computational complexity of coloring graphs with forbidden subgraphsPA Golovach, M Johnson, D Paulusma, J SongJournal of Graph Theory 84, 331-363, 20171342017
2-)
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphsM Bonamy, M Johnson, I Lignos, V Patel, D PaulusmaJournal of Combinatorial Optimization 27, 132-143, 2014108*2014
3-)
Matching games: the least core and the nucleolusW Kern, D PaulusmaMathematics of Operations Research 28, 294-308, 2003962003
4-)
A complete complexity classification of the role assignment problemJ Fiala, D PaulusmaTheoretical Computer Science 349, 67-81, 2005103*2005
5-)
Covering graphs with few complete bipartite subgraphsH Fleischner, E Mujuni, D Paulusma, S SzeiderTheoretical Computer Science 410, 2045-2053, 2009802009
ARTICLES
Add your articles
We use cookies to personalize our website and offer you a better experience. If you accept cookies, we can offer you special services.
Cookie Policy
Accept