default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSándor Szabó
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Andras Hubai
, Sándor Szabó, Bogdán Zaválnij:
Exploratory Data Analysis and Searching Cliques in Graphs. Algorithms 17(3): 112 (2024)- 2022
- [j23]Dóra Kardos, Patrik Patassy, Sándor Szabó, Bogdán Zaválnij:
Numerical experiments with LP formulations of the maximum clique problem. Central Eur. J. Oper. Res. 30(4): 1353-1367 (2022) - [j22]Sándor Szabó, Bogdán Zaválnij:
Graph Coloring via Clique Search with Symmetry Breaking. Symmetry 14(8): 1574 (2022) - 2021
- [j21]Bogdán Zaválnij, Sándor Szabó:
Estimating clique size via discarding subgraphs. Informatica (Slovenia) 45(2) (2021) - [j20]Sándor Szabó:
A Clique Search Problem and its Application to Machine Scheduling. Oper. Res. Forum 2(4) (2021)
2010 – 2019
- 2019
- [j19]Sándor Szabó, Bogdán Zaválnij:
Reducing hypergraph coloring to clique search. Discret. Appl. Math. 264: 196-207 (2019) - [j18]Sándor Szabó, Bogdán Zaválnij:
Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms. Informatica (Slovenia) 43(2) (2019) - [p1]Svetozar Margenov, Thomas Rauber, Emanouil I. Atanassov, Francisco Almeida, Vicente Blanco Pérez, Raimondas Ciegis, Alberto Cabrera Pérez, Neki Frasheri, Stanislav Harizanov, Rima Kriauziene, Gudula Rünger, Pablo San Segundo, Adimas Starikovicius, Sándor Szabó, Bogdán Zaválnij:
Applications for ultrascale systems. Ultrascale Computing Systems 2019: 189-244 - 2018
- [j17]Sándor Szabó, Bogdán Zaválnij:
Decomposing clique search problems into smaller instances based on node and edge colorings. Discret. Appl. Math. 242: 118-129 (2018) - [c16]Sándor Szabó, Bogdán Zaválnij:
A Different Approach to Maximum Clique Search. SYNASC 2018: 310-316 - 2015
- [c15]Ákos Milánkovich, Gergely Ill, Károly Lendvai, Sándor Imre, Sándor Szabó:
Research on Payload Aggregation of Packets in WSNs. SENSORNETS 2015: 187-194 - [c14]András Balogh, Sándor Imre, Károly Lendvai, Sándor Szabó:
Service Mediation in multihop Bluetooth Low Energy networks based on NDN approach. SoftCOM 2015: 285-289 - 2014
- [c13]Ákos Milánkovich, Gergely Ill, Károly Lendvai, Sándor Imre, Sándor Szabó:
Evaluation of Energy Efficiency of Aggregation in WSNs using Petri Nets. SENSORNETS 2014: 289-297 - 2012
- [c12]Ákos Milánkovich, Károly Lendvai, Sándor Imre, Sándor Szabó:
Radio Propagation Modeling on 433 MHz. EUNICE 2012: 384-395 - [c11]Károly Lendvai, Ákos Milánkovich, Sándor Imre, Sándor Szabó:
Optimized packet size for energy efficient delay-tolerant sensor networks. WiMob 2012: 19-25 - 2011
- [j16]Sándor Szabó:
Verifying a conjecture of L. Rédei for p=13. Math. Comput. 80(274): 1155-1162 (2011) - [c10]Sándor Imre, Károly Lendvai, Sándor Szabó:
Ring Based Call Admission Control Scheme for Future Mobile Networks. VTC Spring 2011: 1-5
2000 – 2009
- 2009
- [j15]Péter Fülöp, Sándor Imre, Sándor Szabó, Tamás Szálka:
The Accuracy of Location Prediction Algorithms Based on Markovian Mobility Models. Int. J. Mob. Comput. Multim. Commun. 1(2): 1-21 (2009) - [j14]Péter Fülöp, Sándor Imre, Sándor Szabó, Tamás Szálka:
Accurate mobility modeling and location prediction based on pattern analysis of handover series in mobile networks. Mob. Inf. Syst. 5(3): 255-289 (2009) - [j13]Sándor Szabó:
Polyhedra without diagonals II. Period. Math. Hung. 58(2): 181-187 (2009) - 2008
- [j12]Harri Haanpää, Patric R. J. Östergård, Sándor Szabó:
Small P-Groups with Full-Rank Factorization. Int. J. Algebra Comput. 18(6): 1019-1034 (2008) - [c9]Péter Fülöp, Károly Lendvai, Tamás Szálka, Sándor Imre, Sándor Szabó:
Accurate mobility modeling and location prediction based on pattern analysis of handover series in mobile networks. MoMM 2008: 219-226 - 2007
- [j11]Patric R. J. Östergård, Sándor Szabó:
Elementary P-Groups with the RÉdei Property. Int. J. Algebra Comput. 17(1): 171-178 (2007) - [j10]Arthur D. Sands, Sándor Szabó:
Nonquasi-Periodic Factorizations for Certain Finite Abelian Groups. Int. J. Algebra Comput. 17(4): 837-849 (2007) - [c8]Péter Fülöp, Sándor Szabó, Tamás Szálka:
Location Prediction Methods with Markovian Approach and Extended Random Walk Model. CISIM 2007: 53-58 - [c7]Vilmos Simon, László Bacsárdi, Endre Varga, Tibor Csvorics, Márton Bérces, Sándor Szabó, Sándor Imre:
Overhead reducing information dissemination strategies for opportunistic communications. MWCN 2007: 171-175 - [c6]László Bokor, László Lois, Csaba A. Szabó, Sándor Szabó:
Testbed of a Novel Media Streaming Architecture for Heterogeneous Wireless Environment. TRIDENTCOM 2007: 1-10 - 2006
- [j9]Sherman K. Stein, Sándor Szabó:
The number of distinct symbols in sections of rectangular arrays. Discret. Math. 306(2): 254-261 (2006) - [j8]Sándor Szabó:
Factoring Finite Abelian Groups by Subsets with Maximal Span. SIAM J. Discret. Math. 20(4): 920-931 (2006) - [j7]Sándor Szabó:
Completing codes and the Rédei property of groups. Theor. Comput. Sci. 359(1-3): 449-454 (2006) - 2004
- [c5]Alexandrosz Burulitisz, Sándor Imre, Sándor Szabó:
On the accuracy of mobility modelling in wireless networks. ICC 2004: 2302-2306 - 2003
- [c4]Vilmos Simon, Árpád Huszák, Sándor Szabó, Sándor Imre:
QoS Provision in IP Based Mobile Networks. Euro-Par 2003: 1137-1140 - [c3]Sándor Imre, László Pap, Ferenc Balázs, János Horváth Cz., Róbert Schulcz, Sándor Szabó:
The SONG (SOlutions for Next Generation Mobile Systems) Project. PWC 2003: 207-212 - 2001
- [c2]Sándor Szabó, Sándor Imre:
An Adaptive Handover-Supporting Routing Method for ATM Based Mobile Networks, and Its Adaptation to Ip Scenarios. ICN (2) 2001: 11-19 - 2000
- [j6]Sándor Szabó:
Factoring an Infinite Abelian Group by Subsets. Period. Math. Hung. 40(2): 135-140 (2000)
1990 – 1999
- 1998
- [j5]Sándor Szabó, Coburn Ward:
Factoring elementary groups of prime cube order into subsets. Math. Comput. 67(223): 1199-1206 (1998) - 1991
- [j4]Sándor Szabó:
Lattice Covering by Semicrosses of Arm Length 2. Eur. J. Comb. 12(3): 263-266 (1991)
1980 – 1989
- 1987
- [j3]Sándor Szabó:
A Reduction of Lattice Tiling bz Translates of a Cubical Cluster. Discret. Comput. Geom. 2: 33-36 (1987) - 1986
- [c1]Harry G. McCain, Roger D. Kilmer, Sándor Szabó, Azizollah Abrishamian:
A Hierarchically Controlled Autonomous Robot for Heavy Payload Milittary Field Applications. IAS 1986: 372-381 - 1985
- [j2]Sándor Szabó:
A type of factorization of finite Abelian groups. Discret. Math. 54(1): 121-124 (1985) - 1983
- [j1]Sándor Szabó:
On the problem of regularity of a type of n-dimensional tilings. Discret. Math. 45(2-3): 313-317 (1983)
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-08-05 20:25 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:
