default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTibor Csendes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j49]Botond Bertók
, Tibor Csendes, Gábor Galambos:
Operations research in Hungary: VOCAL 2018. Central Eur. J. Oper. Res. 29(2): 379-386 (2021)- [c4]Dániel Zombori, Balázs Bánhelyi, Tibor Csendes, István Megyeri, Márk Jelasity:
Fooling a Complete Neural Network Verifier. ICLR 2021 - 2020
- [j48]Balázs Bánhelyi, Tibor Csendes, László Hatvani:
On the existence and stabilization of an upper unstable limit cycle of the damped forced pendulum. J. Comput. Appl. Math. 371: 112702 (2020) - [c3]Tibor Csendes, Nándor Balogh, Balázs Bánhelyi, Dániel Zombori, Richárd Tóth, István Megyeri:
Adversarial Example Free Zones for Specific Inputs and Neural Networks. ICAI 2020: 76-84
2010 – 2019
- 2019
- [j47]Botond Bertók, Tibor Csendes, Tibor Jordán:
Editorial. Central Eur. J. Oper. Res. 27(2): 325-327 (2019) - 2017
- [j46]Tibor Csendes, Csanád Imreh, József Temesi:
Editorial. Central Eur. J. Oper. Res. 25(4): 739-741 (2017) - 2016
- [j45]Elvira Antal, Tibor Csendes:
Nonlinear Symbolic Transformations for Simplifying Optimization Problems. Acta Cybern. 22(4): 715-733 (2016) - 2015
- [j44]Tibor Csendes, Lidija Zadnik Stirn, Janez Zerovnik:
Editorial. Central Eur. J. Oper. Res. 23(3): 523-525 (2015) - [j43]Botond Bertók, Tibor Csendes, Tibor Illés:
Editorial. Central Eur. J. Oper. Res. 23(4): 811-813 (2015) - [c2]László Pál, Tibor Csendes:
An improved stochastic local search method in a multistart framework. SACI 2015: 117-120 - 2014
- [j42]Balázs Bánhelyi, Tibor Csendes, Tibor Krisztin, Arnold Neumaier:
Global Attractivity of the Zero Solution for Wright's Equation. SIAM J. Appl. Dyn. Syst. 13(1): 537-563 (2014) - 2013
- [j41]Tibor Csendes, Tibor Jordán, Tamás Szántai:
Editorial. Central Eur. J. Oper. Res. 21(4): 663-664 (2013) - [j40]Elvira Antal, Tibor Csendes, János Virágh:
Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems. Central Eur. J. Oper. Res. 21(4): 665-684 (2013) - [j39]Tibor Csendes, Lidija Zadnik Stirn, Janez Zerovnik:
Editorial. Central Eur. J. Oper. Res. 21(Supplement-1): 1-2 (2013) - [c1]András London, Tibor Csendes:
HITS based network algorithm for evaluating the professional skills of wine tasters. SACI 2013: 197-200 - 2012
- [j38]László Pál, Tibor Csendes, Mihály Csaba Markót, Arnold Neumaier:
Black Box Optimization Benchmarking of the GLOBAL Method. Evol. Comput. 20(4): 609-639 (2012) - 2011
- [j37]Krisztian Veress, Tibor Csendes:
Parameter Estimation of Flow-Measurement in Digital Angiography. Acta Cybern. 20(1): 189-206 (2011) - [j36]Tibor Csendes, Csák Ligeti, József Vörös:
Editorial. Central Eur. J. Oper. Res. 19(2): 155-156 (2011) - [j35]Tibor Csendes, Janez Povh, Lidija Zadnik Stirn, Janez Zerovnik:
Editorial. Central Eur. J. Oper. Res. 19(3): 251-252 (2011) - [j34]Chandra Sekhar Pedamallu, Arun Kumar, Tibor Csendes, Janos Posfai:
An interval partitioning algorithm for constraint satisfaction problems. Int. J. Model. Identif. Control. 14(1/2): 133-140 (2011) - 2010
- [j33]Tibor Csendes, Aurél Galántai, Laszlo Szeidl:
Special issue in honour of Jenő Egerváry. Central Eur. J. Oper. Res. 18(1): 1-3 (2010)
2000 – 2009
- 2009
- [j32]László Pál, Tibor Csendes:
INTLAB implementation of an interval global optimization algorithm. Optim. Methods Softw. 24(4-5): 749-759 (2009) - [r2]Tibor Csendes:
Algorithmic Improvements Using a Heuristic Parameter, Reject Index for Interval Optimization. Encyclopedia of Optimization 2009: 30-33 - [r1]Tibor Csendes:
Interval Analysis: Subdivision Directions in Interval Branch and Bound Methods. Encyclopedia of Optimization 2009: 1717-1721 - 2008
- [j31]Tibor Csendes, József Temesi:
Editorial. Central Eur. J. Oper. Res. 16(4): 329-330 (2008) - [j30]Tibor Csendes, Franco Giannessi, Saul I. Gass:
Preface. J. Glob. Optim. 42(3): 325 (2008) - [j29]Chandra Sekhar Pedamallu, Linet Özdamar, Tibor Csendes, Tamás Vinkó:
Efficient interval partitioning for constrained global optimization. J. Glob. Optim. 42(3): 369-384 (2008) - [j28]Tibor Csendes, László Pál, José-Oscar H. Sendín, Julio R. Banga:
The GLOBAL optimization method revisited. Optim. Lett. 2(4): 445-454 (2008) - [j27]Balázs Bánhelyi, Tibor Csendes, Barnabas M. Garay, László Hatvani:
A Computer-Assisted Proof of Σ3-Chaos in the Forced Damped Pendulum Equation. SIAM J. Appl. Dyn. Syst. 7(3): 843-867 (2008) - 2007
- [b1]Péter Gábor Szabó, Mihály Csaba Markót, Tibor Csendes, Eckhard Specht, Leocadio G. Casado, Inmaculada García:
New Approaches to Circle Packing in a Square - With Program Codes. Optimization and its applications 6, Springer 2007, ISBN 978-0-387-45673-7, pp. I-XIV, 1-238 - [j26]Balázs Bánhelyi, Tibor Csendes, Barnabas M. Garay:
Optimization and the Miranda Approach in Detecting Horseshoe-Type Chaos by Computer. Int. J. Bifurc. Chaos 17(3): 735-747 (2007) - [j25]Chandra Sekhar Pedamallu, Linet Özdamar, Tibor Csendes:
Symbolic Interval Inference Approach for Subdivision Direction Selection in Interval Partitioning Algorithms. J. Glob. Optim. 37(2): 177-194 (2007) - [j24]Erika R. Frits, Mihály Csaba Markót, Zoltan Lelkes, Zsolt Fonyó, Tibor Csendes, Endre Rev:
Use of an interval global optimization tool for exploring feasibility of batch extractive distillation. J. Glob. Optim. 38(2): 297-313 (2007) - 2006
- [j23]Mihály Csaba Markót, Tibor Csendes:
A Reliable Area Reduction Technique for Solving Circle Packing Problems. Computing 77(2): 147-162 (2006) - [j22]Tibor Csendes, Barnabas M. Garay, Balázs Bánhelyi:
A Verified Optimization Technique to Locate Chaotic Regions of Hénon Systems. J. Glob. Optim. 35(1): 145-160 (2006) - [j21]Mihály Csaba Markót, José Fernández, Leocadio G. Casado, Tibor Csendes:
New interval methods for constrained global optimization. Math. Program. 106(2): 287-318 (2006) - 2005
- [j20]Boglárka Tóth, Tibor Csendes:
Empirical Investigation of the Convergence Speed of Inclusion Functions in a Global Optimization Context. Reliab. Comput. 11(4): 253-273 (2005) - [j19]Mihály Csaba Markót, Tibor Csendes:
A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems. SIAM J. Optim. 16(1): 193-219 (2005) - 2004
- [j18]János Balogh, Tibor Csendes, Tamás Rapcsák:
Some Global Optimization Problems on Stiefel Manifolds. J. Glob. Optim. 30(1): 91-101 (2004) - [j17]Tamás Vinkó, Jean-Louis Lagouanelle, Tibor Csendes:
A New Inclusion Function for Optimization: Kite - The One Dimensional Case. J. Glob. Optim. 30(4): 435-456 (2004) - [j16]András Erik Csallner, Tibor Csendes, András Balázs Kocsis:
Reliable Numerical Computation in Civil Engineering. Numer. Algorithms 37(1-4): 85-91 (2004) - [j15]Tibor Csendes:
Generalized Subinterval Selection Criteria for Interval Global Optimization. Numer. Algorithms 37(1-4): 93-100 (2004) - 2003
- [j14]Tibor Csendes:
Numerical Experiences with a New Generalized Subinterval Selection Criterion for Interval Global Optimization. Reliab. Comput. 9(2): 109-125 (2003) - 2001
- [j13]Tibor Csendes:
New Subinterval Selection Criteria for Interval Global Optimization. J. Glob. Optim. 19(3): 307-327 (2001) - 2000
- [j12]Leocadio G. Casado, Inmaculada García, Tibor Csendes:
A New Multisection Technique in Interval Methods for Global Optimization. Computing 65(3): 263-269 (2000) - [j11]Mihály Csaba Markót, Tibor Csendes, András Erik Csallner:
Multisection in Interval Branch-and-Bound Methods for Global Optimization II. Numerical Tests. J. Glob. Optim. 16(3): 219-228 (2000) - [j10]András Erik Csallner, Tibor Csendes, Mihály Csaba Markót:
Multisection in Interval Branch-and-Bound Methods for Global Optimization - I. Theoretical Results. J. Glob. Optim. 16(4): 371-392 (2000)
1990 – 1999
- 1999
- [j9]Tibor Csendes, Zoltán Fülöp:
Preface - Papers from the Conference for PhD Students in Computer Science. Acta Cybern. 14(2): 215-216 (1999) - [j8]Tibor Csendes:
SCAN-98: an IMACS/GAMM International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics. Reliab. Comput. 5(1): 101-102 (1999) - [e1]Tibor Csendes:
Developments in Reliable Computing, International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics, SCAN 1998, Szeged, Hungary, September 22-25, 1998. Springer 1999, ISBN 978-90-481-5350-3 [contents] - 1995
- [j7]Tibor Csendes, Zelda B. Zabinsky, Birna P. Kristinsdottir:
Constructing large feasible suboptimal intervals for constrained nonlinear optimization. Ann. Oper. Res. 58(4): 279-293 (1995) - [j6]Dietmar Ratz, Tibor Csendes:
On the selection of subdivision directions in interval branch-and-bound methods for global optimization. J. Glob. Optim. 7(2): 183-207 (1995) - 1993
- [j5]Tibor Csendes, Tamás Rapcsák:
Nonlinear coordinate transformations for unconstrained optimization I. Basic transformations. J. Glob. Optim. 3(2): 213-221 (1993) - [j4]Tamás Rapcsák, Tibor Csendes:
Nonlinear coordinate transformations for unconstrained optimization II. Theoretical background. J. Glob. Optim. 3(3): 359-375 (1993) - 1992
- [j3]Tibor Csendes, Bálint Daróczy, Zoltán Hantos:
Optimal measuring signal generation. J. Glob. Optim. 2(2): 225-226 (1992)
1980 – 1989
- 1989
- [j2]Tibor Csendes:
An interval method for bounding level sets of parameter estimation problems. Computing 41(1-2): 75-86 (1989) - 1988
- [j1]Tibor Csendes:
Nonlinear Parameter Estimation by Global Optimization - Efficiency and reliability. Acta Cybern. 8(4): 361-372 (1988)
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-25 05:45 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:
