default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrás Faragó
Andras Farago
Person information
- affiliation: University of Texas at Dallas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i12]Andras Farago:
Almost Uniform Sampling of Independent Sets in Polynomial Time - Implying NP=RP. CoRR abs/2312.11838 (2023)- 2021
- [j37]András Faragó
, Zohre R. Mojaveri:
Safe Approximation - An Efficient Solution for a Hard Routing Problem. Algorithms 14(2): 48 (2021) - [j36]András Faragó:
Decomposition of Random Sequences into Mixtures of Simpler Ones and Its Application in Network Analysis. Algorithms 14(11): 336 (2021) - [j35]András Faragó:
A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results - A Survey. Algorithms 14(12): 355 (2021) - [j34]András Faragó:
The Impact of Edge Correlations in Random Networks. Complex Syst. 30(4): 525-537 (2021) - [i11]Zohre Ranjbar-Mojaveri, Andras Farago:
Routing Packet Traffic via Enhanced Access Control List for Network Congestion Avoidance. CoRR abs/2101.10558 (2021) - [i10]Zohre R. Mojaveri, András Faragó:
Routing for Global Congestion Avoidance. CoRR abs/2103.06367 (2021) - 2020
- [j33]András Faragó, Rupei Xu:
A new algorithm design technique for hard problems. Theor. Comput. Sci. 821: 45-56 (2020) - [i9]András Faragó:
Optimization of Virtual Networks. CoRR abs/2011.02964 (2020) - [i8]Zohre Ranjbar-Mojaveri, Andras Farago:
A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties. CoRR abs/2012.02050 (2020) - [i7]Andras Farago:
On Non-Markovian Performance Models. CoRR abs/2012.07152 (2020)
2010 – 2019
- 2019
- [j32]András Faragó, Zohre R. Mojaveri:
In Search of the Densest Subgraph. Algorithms 12(8): 157 (2019) - [i6]Rupei Xu, András Faragó, Jason P. Jue:
Job Edge-Fog Interconnection Network Creation Game in Internet of Things. CoRR abs/1905.01443 (2019) - [i5]Rupei Xu, András Faragó:
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem. CoRR abs/1908.06541 (2019) - 2018
- [c49]András Faragó:
A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory. AAIM 2018: 281-292 - [i4]Rupei Xu, András Faragó:
A Simple Approximation for a Hard Routing Problem. CoRR abs/1809.06562 (2018) - [i3]Ahmad Askarian, Rupei Xu, András Faragó:
Utilizing Network Structure to Bound the Convergence Rate in Markov Chain Monte Carlo Algorithms. CoRR abs/1809.06564 (2018) - [i2]András Faragó, Rupei Xu:
Connectivity and Structure in Large Networks. CoRR abs/1809.06568 (2018) - 2016
- [j31]Ahmad Askarian, Rupei Xu, András Faragó:
Utilizing Network Structure to Accelerate Markov Chain Monte Carlo Algorithms. Algorithms 9(3): 50 (2016) - [i1]Andras Farago:
Roughly Polynomial Time: A Concept of Tractability Covering All Known Natural NP-complete Problems. CoRR abs/1608.08679 (2016) - 2015
- [c48]Andras Farago:
Topology analysis of multi-hop wireless networks. HPSR 2015: 239-244 - 2013
- [c47]Andras Farago:
Network reliability analysis with unreliable information. DRCN 2013: 258-265 - 2012
- [c46]András Faragó:
Network analysis under perturbations. FOMC 2012: 4 - [c45]Zhiming Chen, András Faragó, Kang Zhang:
Exploring Structural Properties of Web Graphs through 3D Visualization. ICEIS (2) 2012: 233-238 - [c44]András Faragó:
Brief announcement: an obstacle to scalability in wireless networks. PODC 2012: 235-236 - 2011
- [j30]András Faragó:
Asymptotically optimal trade-off between local and global connectivity in wireless networks. Perform. Evaluation 68(2): 142-156 (2011) - [c43]András Faragó, Stefano Basagni:
Connecting Two Worlds: Physical Models and Graph Models of Wireless Network Topologies. HPCC 2011: 739-744 - [c42]András Faragó:
Low Distortion Metric Embedding into Constant Dimension. TAMC 2011: 114-123 - 2010
- [j29]András Faragó:
On the Structure of Classes of Random Graphs. Chic. J. Theor. Comput. Sci. 2010 (2010) - [j28]Chen Wang, James Willson, Myung Ah Park, Andras Farago, Weili Wu:
On dual power assignment optimization for biconnectivity. J. Comb. Optim. 19(2): 174-183 (2010) - [c41]András Faragó, Dung T. Tran:
A Self-Tuning Protocol for Optimal Bandwidth Allocation in Wireless Networks. SASO 2010: 265-266
2000 – 2009
- 2009
- [j27]Andras Farago:
Scalability of Node Degrees in Random Wireless Network Topologies. IEEE J. Sel. Areas Commun. 27(7): 1238-1244 (2009) - [c40]Andras Farago:
Structural Properties of Random Graph Models. CATS 2009: 129-136 - [c39]Stefano Basagni, Andras Farago, Maurizio A. Nanni, Dung T. Tran:
Increased Connectivity at Lower Cost: The Case for Multi-Radio Nodes in Multi-Hop Wireless Networks. GLOBECOM 2009: 1-6 - [c38]Andras Farago:
Analysis of Fundamental Limits for Partial Connectivity in Wireless Networks. GLOBECOM 2009: 1-6 - [c37]András Faragó:
Local vs. Global Scalability in Ad Hoc and Sensor Networks. Infoscale 2009: 26-45 - [c36]Andras Farago:
Quantifying the Trade-off Between the Level of Connectivity and Local Complexity in Random Wireless Network Topologies. QEST 2009: 237-246 - 2008
- [j26]András Faragó:
Algorithmic Challenges in Learning Path Metrics from Observed Choices. Appl. Artif. Intell. 22(7&8): 749-760 (2008) - [j25]Natarajan Meghanathan, Andras Farago:
On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks. Ad Hoc Networks 6(5): 744-769 (2008) - [j24]András Faragó:
Efficient blocking probability computation of complex traffic flows for network dimensioning. Comput. Oper. Res. 35(12): 3834-3847 (2008) - [j23]András Faragó:
A General Tractable Density Concept for Graphs. Math. Comput. Sci. 1(4): 689-699 (2008) - [j22]Chen Wang, Myung Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu:
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity. Theor. Comput. Sci. 396(1-3): 180-190 (2008) - [c35]András Faragó:
On the Descriptional Complexity of Path Optimization in Graphs. DCFS 2008: 207-215 - [c34]Andras Farago:
On Disjoint Connecting Paths and Unsplittable Flow. FCS 2008: 44-50 - [c33]Chen Wang, Myung Ah Park, James Willson, Andras Farago, Ding-Zhu Du:
Fault-Tolerant Dual Power Management in Wireless Sensor Networks. GLOBECOM 2008: 436-441 - 2007
- [j21]András Faragó:
On the Fundamental Limits of Topology Control in Ad Hoc Networks. Algorithmica 49(4): 337-356 (2007) - [c32]Andras Farago:
Methods for Handling Non-Markovian Performance Models. Communications in Computing 2007: 97-103 - [c31]Andras Farago:
Sampling from Independence Systems. FCS 2007: 27-33 - [c30]Myung Ah Park, Andras Farago:
Minimum Frequencies for the Virtual Maximum MAC Capacity in a Multichannel Ad-Hoc Network. LCN 2007: 725-730 - [c29]Andras Farago:
Learning Path Metrics from Observed Choices. MLMTA 2007: 163-169 - [c28]Myung Ah Park, James Willson, Chen Wang, My T. Thai, Weili Wu, Andras Farago:
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges. MobiHoc 2007: 22-31 - 2006
- [c27]Andras Farago:
Towards the Integration of Reliability and Traffic Engineering. Communications in Computing 2006: 28-34 - [c26]Hao Wang, Andras Farago:
On-line Algorithm for Server Selection of Video Streaming over P2P Networks. Communications in Computing 2006: 121-127 - [c25]András Faragó:
On the Convergence Rate of Quasi Lumpable Markov Chains. EPEW 2006: 138-147 - [c24]Andras Farago:
Speeeding Up Markov Chain Monte Carlo Algorithms. FCS 2006: 102-108 - 2005
- [j20]András Faragó:
On the typical case complexity of graph optimization. Discret. Appl. Math. 153(1-3): 73-88 (2005) - [c23]Natarajan Meghanathan, Andras Farago:
Power sensitive power control in ad networks. ACM Southeast Regional Conference (2) 2005: 81-86 - [c22]András Faragó:
New analytical results on ad hoc network connectivity. Communications and Computer Networks 2005: 126-131 - [c21]Andras Farago:
Finding Dense Subgraphs Efficiently. FCS 2005: 73-79 - [c20]Andras Farago:
Almost Surely Almost Exact Optimization in Random Graphs. FCS 2005: 94-100 - [c19]Hao Wang, Andras Farago, Subbarayan Venkatesan:
Video Streaming Over Multi-hop Wireless Networks. ISM 2005: 624-629 - [c18]Natarajan Meghanathan, András Faragó:
An efficient algorithm for the optimal number of route transitions in mobile ad hoc networks. WiMob (3) 2005: 41-48 - [c17]Natarajan Meghanathan, András Faragó:
On the route refresh frequency for on-demand battery life routing in ad hoc networks. WiMob (3) 2005: 291-298 - 2004
- [c16]András Faragó:
On the fundamental limits of topology control. DIALM-POMC 2004: 1-7 - [c15]András Faragó:
Availability estimation of routes, trees and subnetworks for end-to-end QoS. GLOBECOM 2004: 3583-3587 - [c14]Natarajan Meghanathan, Andras Farago:
Looking at protocol efficiency from a new angle: stability - delay analysis. Mobility Management & Wireless Access Protocols 2004: 51-55 - 2003
- [j19]András Faragó, Áron Szentesi, Balázs Szviatovszki:
Inverse Optimization in High-speed Networks. Discret. Appl. Math. 129(1): 83-98 (2003) - [j18]András Faragó, Violet R. Syrotiuk:
MERIT: A Scalable Approach for Protocol Assessment. Mob. Networks Appl. 8(5): 567-577 (2003) - [c13]András Faragó, Ferenc Unghváry, Andrea Fumagalli:
On incorporating dependent link failures in a traffic engineering model. ICC 2003: 309-312 - [c12]András Faragó:
A Mathematical Method for Analyzing the Effect of Different Protocol Layers on Routing in Ad Hoc Networks. International Conference on Wireless Networks 2003: 626-631 - 2002
- [c11]András Faragó:
Scalable analysis and design of ad hoc networks via random graph theory. DIAL-M 2002: 43-50 - [c10]Andrea Fumagalli, Marco Tacca, Ferenc Unghváry, András Faragó:
Shared path protection with differentiated reliability. ICC 2002: 2157-2161 - [c9]András Faragó:
Network Level Capacity Planning with Efficiently Computable Global Optimum. MASCOTS 2002: 229-236 - 2001
- [c8]András Faragó, Violet R. Syrotiuk:
Algorithmic Problems in Power-Controlled Ad Hoc Networks. PDCS 2001: 177-182 - [c7]András Faragó, Violet R. Syrotiuk:
Merit: A unified framework for routing protocol assessment in mobile Ad Hoc networks. MobiCom 2001: 53-60 - 2000
- [j17]Andras Farago, Andrew D. Myers, Violet R. Syrotiuk, Gergely V. Záruba:
Meta-MAC protocols: automatic combination of MAC protocols to optimize performance for unknown conditions. IEEE J. Sel. Areas Commun. 18(9): 1670-1681 (2000) - [c6]András Faragó, Andrew D. Myers, Violet R. Syrotiuk, Gergely V. Záruba:
A new approach to MAC protocol optimization. GLOBECOM 2000: 1742-1746 - [c5]András Faragó:
Blocking Probability Estimation for General Under Incomplete Information. ICC (3) 2000: 1547-1551
1990 – 1999
- 1999
- [j16]Imrich Chlamtac, András Faragó:
A new approach to the design and analysis of peer-to-peer mobile networks. Wirel. Networks 5(3): 149-156 (1999) - [c4]Hongbiao Zhang, Imrich Chlamtac, András Faragó:
Efficient load balancing for UBR traffic in ATM networks. ICC 1999: 474-478 - [c3]András Faragó, Imrich Chlamtac, Stefano Basagni:
Virtual Path Network Topology Optimization Using Random Graphs. INFOCOM 1999: 491-496 - 1998
- [j15]Paramvir Bahl, Imrich Chlamtac, András Faragó:
Resource assignment for integrated services in wireless ATM networks. Int. J. Commun. Syst. 11(1): 29-41 (1998) - [j14]Imrich Chlamtac, Hongbiao Zhang, András Faragó, Andrea Fumagalli:
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks. IEEE/ACM Trans. Netw. 6(4): 422-431 (1998) - 1997
- [j13]András Faragó, József Bíró, Tamás Henk, Miklós Boda:
Analog Neural Optimization for ATM Resource Management. IEEE J. Sel. Areas Commun. 15(2): 156-164 (1997) - [j12]Andras Farago:
Broadband integrated networks: Mischa Schwartz, Prentice Hall, 1996. ACM SIGMOBILE Mob. Comput. Commun. Rev. 1(1): 5 (1997) - [j11]Krzysztof Szarkowicz, Gábor Fodor, András Faragó, Tamás Henk:
Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks. Simul. 68(1): 34-43 (1997) - [j10]Imrich Chlamtac, András Faragó, Hongbiao Zhang:
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks. IEEE/ACM Trans. Netw. 5(6): 804-812 (1997) - [c2]Paramvir Bahl, Imrich Chlamtac, András Faragó:
Optimizing Resource Utilization in Wireless Multimedia Networks. ICC (3) 1997: 1432-1437 - 1996
- [j9]Imrich Chlamtac, András Faragó, Tao Zhang:
Lightpath (Wavelength) Routing in Large WDM Networks. IEEE J. Sel. Areas Commun. 14(5): 909-913 (1996) - 1995
- [j8]András Faragó, Søren Blaabjerg, László Ast, Géza Gordos, Tamás Henk:
A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration. IEEE J. Sel. Areas Commun. 13(7): 1199-1206 (1995) - [j7]András Faragó:
On the complexity of finding sparsest and densest parts in wireless networks. Wirel. Networks 1(2): 221-226 (1995) - [c1]András Faragó, Søren Blaabjerg, W. Holender, B. Stavenow, Tamás Henk, László Ast, Sándor Székely:
Enhancing ATM Network Performance by Optimizing the Virtual Network Configuration. Data Communications and their Performance 1995: 401-414 - 1994
- [j6]Imrich Chlamtac, András Faragó, Hye Yeon Ahn:
A topology transparent link activation protocol for mobile CDMA radio networks. IEEE J. Sel. Areas Commun. 12(8): 1426-1433 (1994) - [j5]Imrich Chlamtac, András Faragó:
An Optimal Channel Access Protocol with Multiple Reception Capacity. IEEE Trans. Computers 43(4): 480-484 (1994) - [j4]Imrich Chlamtac, András Faragó:
Making transmission schedules immune to topology changes in multi-hop packet radio networks. IEEE/ACM Trans. Netw. 2(1): 23-29 (1994) - [j3]Imrich Chlamtac, András Faragó, Tao Zhang:
Optimizing the system of virtual paths. IEEE/ACM Trans. Netw. 2(6): 581-587 (1994) - 1993
- [j2]András Faragó, Tamás Linder, Gábor Lugosi:
Fast Nearest-Neighbor Search in Dissimilarity Spaces. IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 957-962 (1993) - [j1]András Faragó, Gábor Lugosi:
Strong universal consistency of neural network classifiers. IEEE Trans. Inf. Theory 39(4): 1146-1151 (1993)
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-16 00:40 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:
