default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard B. Tan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j14]Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen:
Shortcutting directed and undirected networks with a degree constraint. Discret. Appl. Math. 220: 91-117 (2017)
2000 – 2009
- 2009
- [j13]Tiziana Calamoneri
, Emanuele G. Fusco, Richard B. Tan, Paola Vocca:
L ( h , 1, 1)-labeling of outerplanar graphs. Math. Methods Oper. Res. 69(2): 307-321 (2009) - 2008
- [c14]Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan:
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. ISAAC 2008: 306-317 - [c13]Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen:
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. SWAT 2008: 102-113 - 2006
- [j12]Carlo Gaibisso, Guido Proietti, Richard B. Tan:
Efficient management of transient station failures in linear radio communication networks with bases. J. Parallel Distributed Comput. 66(4): 556-565 (2006) - [c12]Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca:
L(h, 1, 1)-Labeling of Outerplanar Graphs. SIROCCO 2006: 268-279 - 2004
- [j11]Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen:
Approximations for lambda-Colorings of Graphs. Comput. J. 47(2): 193-204 (2004) - 2003
- [j10]Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen:
Finding a bigtriangleup-regular supergraph of minimum order. Discret. Appl. Math. 131(1): 3-9 (2003) - [j9]Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan:
Channel Assignment with Separation for Interference Avoidance in Wireless Networks. IEEE Trans. Parallel Distributed Syst. 14(3): 222-235 (2003) - [c11]Carlo Gaibisso, Guido Proietti, Richard B. Tan:
Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. COCOON 2003: 404-414 - 2002
- [c10]Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan:
Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings. IPDPS 2002 - 2001
- [j8]Ton Kloks, Richard B. Tan:
Bandwidth and topological bandwidth of graphs with few P4's. Discret. Appl. Math. 115(1-3): 117-133 (2001) - [j7]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. Networks 37(4): 225-232 (2001) - 2000
- [c9]Alan A. Bertossi, Maria Cristina Pinotti, Richard B. Tan:
Efficient use of radio spectrum in wireless networks with channel separation between close stations. DIAL-M 2000: 18-27 - [c8]Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen:
lambda-Coloring of Graphs. STACS 2000: 395-406
1990 – 1999
- 1999
- [c7]Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan:
Fundamental Distributed Protocols in Mobile Networks. PODC 1999: 274 - [c6]Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan:
Fundamental Control Algorithms in Mobile Networks. SPAA 1999: 251-260 - 1998
- [j6]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Multidimensional Interval Routing Schemes. Theor. Comput. Sci. 205(1-2): 115-133 (1998) - [c5]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Characterization results of all shortest paths interval routing schemes. SIROCCO 1998: 201-213 - 1997
- [j5]Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos:
On Interval Routing Schemes and Treewidth. Inf. Comput. 139(1): 92-109 (1997) - 1995
- [c4]Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan:
Multi-Dimensional Interval Routing Schemes. WDAG 1995: 131-144 - [c3]Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen:
On Interval Routing Schemes and Treewidth. WG 1995: 181-196 - 1994
- [c2]Jan van Leeuwen, Richard B. Tan:
Compact Routing Methods: A Survey. SIROCCO 1994: 99-110 - 1993
- [j4]Erwin M. Bakker, Jan van Leeuwen, Richard B. Tan:
Prefix Routing Schemes in Dynamic Networks. Comput. Networks ISDN Syst. 26(4): 403-421 (1993)
1980 – 1989
- 1988
- [j3]Gerard Tel, Richard B. Tan, Jan van Leeuwen:
The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols. Sci. Comput. Program. 10(1): 107-137 (1988) - 1987
- [j2]Jan van Leeuwen, Richard B. Tan:
Interval Routing. Comput. J. 30(4): 298-307 (1987) - [j1]Jan van Leeuwen, Richard B. Tan:
An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors. Distributed Comput. 2(3): 149-160 (1987) - [c1]Gerard Tel, Richard B. Tan, Jan van Leeuwen:
The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols. STACS 1987: 445-455
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
