default search action
Robert Tijdeman
Person information
- affiliation: Leiden University, Mathematical Institute, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j25]Matthew Ceko, Lajos Hajdu, Rob Tijdeman:
Error Correction for Discrete Tomography. Fundam. Informaticae 189(2): 91-112 (2022) - 2021
- [j24]Matthew Ceko
, Silvia M. C. Pagani
Algorithms for linear time reconstruction by discrete tomography II. Discret. Appl. Math. 298: 7-20 (2021) - [j23]Matthew Ceko
Boundary Ghosts for Discrete Tomography. J. Math. Imaging Vis. 63(3): 428-440 (2021) - [j22]Matthew Ceko
Three-Dimensional Maximal and Boundary Ghosts. J. Math. Imaging Vis. 63(8): 1084-1093 (2021)
2010 – 2019
- 2019
- [j21]Silvia M. C. Pagani, Robert Tijdeman:
Algorithms for linear time reconstruction by discrete tomography. Discret. Appl. Math. 271: 152-170 (2019) - [j20]András Hajdu
Finding well approximating lattices for a finite set of points. Math. Comput. 88(315): 369-387 (2019) - 2017
- [j19]Lajos Hajdu, Robert Tijdeman:
Consistency Conditions for Discrete Tomography. Fundam. Informaticae 155(4): 425-447 (2017) - 2016
- [c2]András Hajdu
Measuring regularity of network patterns by grid approximations using the LLL algorithm. ICPR 2016: 1524-1529 - 2014
- [j18]K. Gyory, Lajos Hajdu, Robert Tijdeman:
Representation of finite graphs as difference graphs of S-units, I. J. Comb. Theory A 127: 314-335 (2014) - 2013
- [j17]Kees Joost Batenburg, Wagner Fortes, Lajos Hajdu, Robert Tijdeman:
Bounds on the quality of reconstructed images in binary tomography. Discret. Appl. Math. 161(15): 2236-2251 (2013) - [j16]Kees Joost Batenburg, Wagner Fortes, Robert Tijdeman:
Approximate Discrete Reconstruction Algorithm. Fundam. Informaticae 125(3-4): 239-259 (2013) - [j15]Lajos Hajdu, Robert Tijdeman:
Bounds for Approximate Discrete Tomography Solutions. SIAM J. Discret. Math. 27(2): 1055-1066 (2013) - [p1]T. N. Shorey, Robert Tijdeman:
Some Methods of Erdős Applied to Finite Arithmetic Progressions. The Mathematics of Paul Erdős I 2013: 269-287 - 2012
- [j14]András Hajdu
Approximation of the Euclidean Distance by Chamfer Distances. Acta Cybern. 20(3): 399-417 (2012) - [i1]András Hajdu, Lajos Hajdu, Robert Tijdeman:
Approximations of the Euclidean distance by chamfer distances. CoRR abs/1201.0876 (2012) - 2011
- [c1]Kees Joost Batenburg, Wagner Fortes, Lajos Hajdu, Robert Tijdeman:
Bounds on the Difference between Reconstructions in Binary Tomography. DGCI 2011: 369-380
2000 – 2009
- 2009
- [j13]Robert Tijdeman, Luca Q. Zamboni:
Fine and Wilf words for any periods II. Theor. Comput. Sci. 410(30-32): 3027-3034 (2009) - 2007
- [j12]András Hajdu
General neighborhood sequences in Zn. Discret. Appl. Math. 155(18): 2507-2522 (2007) - 2005
- [j11]Robert Tijdeman:
Rauzy substitutions and multi-dimensional Sturmian words. Theor. Comput. Sci. 346(2-3): 469-489 (2005) - 2004
- [j10]Valérie Berthé, Robert Tijdeman:
Lattices and multi-dimensional words. Theor. Comput. Sci. 319(1-3): 177-202 (2004) - 2003
- [j9]Lajos Hajdu, Robert Tijdeman:
Algebraic aspects of emission tomography with absorption. Theor. Comput. Sci. 290(3): 2169-2181 (2003) - 2002
- [j8]J. W. Sander, Robert Tijdeman:
The rectangle complexity of functions on two-dimensional lattices. Theor. Comput. Sci. 270(1-2): 857-863 (2002) - [j7]Valérie Berthé, Robert Tijdeman:
Balance properties of multi-dimensional words. Theor. Comput. Sci. 273(1-2): 197-224 (2002) - 2000
- [j6]Robert Tijdeman:
Fraenkel's conjecture for six sequences. Discret. Math. 222(1-3): 223-234 (2000) - [j5]J. W. Sander, Robert Tijdeman:
The complexity of functions on lattices. Theor. Comput. Sci. 246(1-2): 195-225 (2000)
1990 – 1999
- 1999
- [j4]Robert Tijdeman:
Discrete tomography in four directions. Electron. Notes Discret. Math. 3: 195-198 (1999)
1980 – 1989
- 1981
- [j3]Andries E. Brouwer, Robert Tijdeman:
On the edge-colouring problem for unions of complete uniform hypergraphs. Discret. Math. 34(3): 241-260 (1981) - 1980
- [j2]Robert Tijdeman:
The chairman assignment problem. Discret. Math. 32(3): 323-330 (1980)
1970 – 1979
- 1973
- [j1]Robert Tijdeman:
On a Distribution Problem in Finite and Countable Sets. J. Comb. Theory A 15(2): 129-137 (1973)
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-06-10 21:24 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: