Artur Czumaj

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alan Gibbons

> Home > Persons > Artur Czumaj

Publications

2001
[j16]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/CzumajFGGLRZ01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CzumajFGGLRZ01
Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient web searching using temporal factors. Theor. Comput. Sci. 262(1): 569-582 (2001)
1999
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/wads/CzumajFGGLRZ99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/CzumajFGGLRZ99
Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient Web Searching Using Temporal Factors. WADS 1999: 294-305
1996
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/CzumajG96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CzumajG96
Artur Czumaj, Alan Gibbons:
Guthrie's Problem: New Equivalences and Rapid Reductions. Theor. Comput. Sci. 154(1): 3-22 (1996)
1993
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/CzumajG93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/CzumajG93
Artur Czumaj, Alan Gibbons:
Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. ICALP 1993: 88-101

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.