Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Danupon Nanongkai

◀ ▶ joint publications with Jittat Fakcharoenphol

> Home > Persons > Danupon Nanongkai

Publications

2014
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/FakcharoenpholLN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/FakcharoenpholLN14
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. ACM Trans. Algorithms 10(3): 14:1-14:23 (2014)
2010
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/FakcharoenpholLN10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/FakcharoenpholLN10
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-matching Problems (Extended Abstract). ICALP (1) 2010: 176-187
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1004-3363
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1004-3363
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. CoRR abs/1004.3363 (2010)
2004
[c1]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/ChalermsookFN04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChalermsookFN04
Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai:
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA 2004: 828-829

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.