Fast Nearest-Neighbor Search in Dissimilarity Spaces. - András Faragó; Tamás Linder; Gábor Lugosi (IEEE Trans. Pattern Anal. Mach. Intell., 1993)

Strong universal consistency of neural network classifiers. - András Faragó; Gábor Lugosi (IEEE Trans. Inf. Theory, 1993)

A topology transparent link activation protocol for mobile CDMA radio networks. - Imrich Chlamtac; András Faragó; Hye Yeon Ahn (IEEE J. Sel. Areas Commun., 1994)

An Optimal Channel Access Protocol with Multiple Reception Capacity. - Imrich Chlamtac; András Faragó (IEEE Trans. Computers, 1994)

Making transmission schedules immune to topology changes in multi-hop packet radio networks. - Imrich Chlamtac; András Faragó (IEEE/ACM Trans. Netw., 1994)

Optimizing the system of virtual paths. - Imrich Chlamtac; András Faragó; Tao Zhang 043 (IEEE/ACM Trans. Netw., 1994)

Enhancing ATM Network Performance by Optimizing the Virtual Network Configuration. - András Faragó; Søren Blaabjerg; W. Holender; B. Stavenow; Tamás Henk; László Ast; Sándor Székely (Data Communications and their Performance, 1995)

A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration. - András Faragó; Søren Blaabjerg; László Ast; Géza Gordos; Tamás Henk (IEEE J. Sel. Areas Commun., 1995)

On the complexity of finding sparsest and densest parts in wireless networks. - András Faragó (Wirel. Networks, 1995)

Lightpath (Wavelength) Routing in Large WDM Networks. - Imrich Chlamtac; András Faragó; Tao Zhang 043 (IEEE J. Sel. Areas Commun., 1996)

Optimizing Resource Utilization in Wireless Multimedia Networks. - Paramvir Bahl; Imrich Chlamtac; András Faragó (ICC (3), 1997)

Analog Neural Optimization for ATM Resource Management. - András Faragó; József Bíró; Tamás Henk; Miklós Boda (IEEE J. Sel. Areas Commun., 1997)

Broadband integrated networks: Mischa Schwartz, Prentice Hall, 1996. - Andras Farago (ACM SIGMOBILE Mob. Comput. Commun. Rev., 1997)

Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks. - Krzysztof Szarkowicz; Gábor Fodor 001; András Faragó; Tamás Henk (Simul., 1997)

Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks. - Imrich Chlamtac; András Faragó; Hongbiao Zhang (IEEE/ACM Trans. Netw., 1997)

Resource assignment for integrated services in wireless ATM networks. - Paramvir Bahl; Imrich Chlamtac; András Faragó (Int. J. Commun. Syst., 1998)

A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks. - Imrich Chlamtac; Hongbiao Zhang; András Faragó; Andrea Fumagalli (IEEE/ACM Trans. Netw., 1998)

Efficient load balancing for UBR traffic in ATM networks. - Hongbiao Zhang; Imrich Chlamtac; András Faragó (ICC, 1999)

Virtual Path Network Topology Optimization Using Random Graphs. - András Faragó; Imrich Chlamtac; Stefano Basagni (INFOCOM, 1999)

A new approach to the design and analysis of peer-to-peer mobile networks. - Imrich Chlamtac; András Faragó (Wirel. Networks, 1999)

A new approach to MAC protocol optimization. - András Faragó; Andrew D. Myers; Violet R. Syrotiuk; Gergely V. Záruba (GLOBECOM, 2000)

Blocking Probability Estimation for General Under Incomplete Information. - András Faragó (ICC (3), 2000)

Meta-MAC protocols: automatic combination of MAC protocols to optimize performance for unknown conditions. - Andras Farago; Andrew D. Myers; Violet R. Syrotiuk; Gergely V. Záruba (IEEE J. Sel. Areas Commun., 2000)

Algorithmic Problems in Power-Controlled Ad Hoc Networks. - András Faragó; Violet R. Syrotiuk (PDCS, 2001)

Merit: A unified framework for routing protocol assessment in mobile Ad Hoc networks. - András Faragó; Violet R. Syrotiuk (MobiCom, 2001)

Scalable analysis and design of ad hoc networks via random graph theory. - András Faragó (DIAL-M, 2002)

Shared path protection with differentiated reliability. - Andrea Fumagalli; Marco Tacca; Ferenc Unghváry; András Faragó (ICC, 2002)

Network Level Capacity Planning with Efficiently Computable Global Optimum. - András Faragó (MASCOTS, 2002)

On incorporating dependent link failures in a traffic engineering model. - András Faragó; Ferenc Unghváry; Andrea Fumagalli (ICC, 2003)

A Mathematical Method for Analyzing the Effect of Different Protocol Layers on Routing in Ad Hoc Networks. - András Faragó (International Conference on Wireless Networks, 2003)

Inverse Optimization in High-speed Networks. - András Faragó; Áron Szentesi; Balázs Szviatovszki (Discret. Appl. Math., 2003)

MERIT: A Scalable Approach for Protocol Assessment. - András Faragó; Violet R. Syrotiuk (Mob. Networks Appl., 2003)

On the fundamental limits of topology control. - András Faragó (DIALM-POMC, 2004)

Availability estimation of routes, trees and subnetworks for end-to-end QoS. - András Faragó (GLOBECOM, 2004)

Looking at protocol efficiency from a new angle: stability - delay analysis. - Natarajan Meghanathan; Andras Farago (Mobility Management & Wireless Access Protocols, 2004)

Power sensitive power control in ad networks. - Natarajan Meghanathan; Andras Farago (ACM Southeast Regional Conference (2), 2005)

New analytical results on ad hoc network connectivity. - András Faragó (Communications and Computer Networks, 2005)

Finding Dense Subgraphs Efficiently. - Andras Farago (FCS, 2005)

Almost Surely Almost Exact Optimization in Random Graphs. - Andras Farago (FCS, 2005)

Video Streaming Over Multi-hop Wireless Networks. - Hao Wang; Andras Farago; Subbarayan Venkatesan (ISM, 2005)

An efficient algorithm for the optimal number of route transitions in mobile ad hoc networks. - Natarajan Meghanathan; András Faragó (WiMob (3), 2005)

On the route refresh frequency for on-demand battery life routing in ad hoc networks. - Natarajan Meghanathan; András Faragó (WiMob (3), 2005)

On the typical case complexity of graph optimization. - András Faragó (Discret. Appl. Math., 2005)

Towards the Integration of Reliability and Traffic Engineering. - Andras Farago (Communications in Computing, 2006)

On-line Algorithm for Server Selection of Video Streaming over P2P Networks. - Hao Wang; Andras Farago (Communications in Computing, 2006)

On the Convergence Rate of Quasi Lumpable Markov Chains. - András Faragó (EPEW, 2006)

Speeeding Up Markov Chain Monte Carlo Algorithms. - Andras Farago (FCS, 2006)

Methods for Handling Non-Markovian Performance Models. - Andras Farago (Communications in Computing, 2007)

Sampling from Independence Systems. - Andras Farago (FCS, 2007)

Minimum Frequencies for the Virtual Maximum MAC Capacity in a Multichannel Ad-Hoc Network. - Myung Ah Park; Andras Farago (LCN, 2007)

Learning Path Metrics from Observed Choices. - Andras Farago (MLMTA, 2007)

A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges. - Myung Ah Park; James Willson; Chen Wang 059; My T. Thai; Weili Wu 001; Andras Farago (MobiHoc, 2007)

On the Fundamental Limits of Topology Control in Ad Hoc Networks. - András Faragó (Algorithmica, 2007)

On the Descriptional Complexity of Path Optimization in Graphs. - András Faragó (DCFS, 2008)

On Disjoint Connecting Paths and Unsplittable Flow. - Andras Farago (FCS, 2008)

Fault-Tolerant Dual Power Management in Wireless Sensor Networks. - Chen Wang 059; Myung Ah Park; James Willson; Andras Farago; Ding-Zhu Du (GLOBECOM, 2008)

Algorithmic Challenges in Learning Path Metrics from Observed Choices. - András Faragó (Appl. Artif. Intell., 2008)

On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks. - Natarajan Meghanathan; Andras Farago (Ad Hoc Networks, 2008)

Efficient blocking probability computation of complex traffic flows for network dimensioning. - András Faragó (Comput. Oper. Res., 2008)

A General Tractable Density Concept for Graphs. - András Faragó (Math. Comput. Sci., 2008)

On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity. - Chen Wang 059; Myung Ah Park; James Willson; Yongxi Cheng; Andras Farago; Weili Wu 001 (Theor. Comput. Sci., 2008)

Structural Properties of Random Graph Models. - Andras Farago (CATS, 2009)

Increased Connectivity at Lower Cost: The Case for Multi-Radio Nodes in Multi-Hop Wireless Networks. - Stefano Basagni; Andras Farago; Maurizio A. Nanni; Dung T. Tran (GLOBECOM, 2009)

Analysis of Fundamental Limits for Partial Connectivity in Wireless Networks. - Andras Farago (GLOBECOM, 2009)

Local vs. Global Scalability in Ad Hoc and Sensor Networks. - András Faragó (Infoscale, 2009)

Quantifying the Trade-off Between the Level of Connectivity and Local Complexity in Random Wireless Network Topologies. - Andras Farago (QEST, 2009)

Scalability of Node Degrees in Random Wireless Network Topologies. - Andras Farago (IEEE J. Sel. Areas Commun., 2009)

A Self-Tuning Protocol for Optimal Bandwidth Allocation in Wireless Networks. - András Faragó; Dung T. Tran (SASO, 2010)

On the Structure of Classes of Random Graphs. - András Faragó (Chic. J. Theor. Comput. Sci., 2010)

On dual power assignment optimization for biconnectivity. - Chen Wang 059; James Willson; Myung Ah Park; Andras Farago; Weili Wu 001 (J. Comb. Optim., 2010)

Connecting Two Worlds: Physical Models and Graph Models of Wireless Network Topologies. - András Faragó; Stefano Basagni (HPCC, 2011)

Low Distortion Metric Embedding into Constant Dimension. - András Faragó (TAMC, 2011)

Asymptotically optimal trade-off between local and global connectivity in wireless networks. - András Faragó (Perform. Evaluation, 2011)

Network analysis under perturbations. - András Faragó (FOMC, 2012)

Exploring Structural Properties of Web Graphs through 3D Visualization. - Zhiming Chen; András Faragó; Kang Zhang (ICEIS (2), 2012)

Brief announcement: an obstacle to scalability in wireless networks. - András Faragó (PODC, 2012)

Network reliability analysis with unreliable information. - Andras Farago (DRCN, 2013)

Topology analysis of multi-hop wireless networks. - Andras Farago (HPSR, 2015)

Utilizing Network Structure to Accelerate Markov Chain Monte Carlo Algorithms. - Ahmad Askarian; Rupei Xu; András Faragó (Algorithms, 2016)

Roughly Polynomial Time: A Concept of Tractability Covering All Known Natural NP-complete Problems. - Andras Farago (CoRR, 2016)

A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory. - András Faragó (AAIM, 2018)

A Simple Approximation for a Hard Routing Problem. - Rupei Xu; András Faragó (CoRR, 2018)

Utilizing Network Structure to Bound the Convergence Rate in Markov Chain Monte Carlo Algorithms. - Ahmad Askarian; Rupei Xu; András Faragó (CoRR, 2018)

Connectivity and Structure in Large Networks. - András Faragó; Rupei Xu (CoRR, 2018)

In Search of the Densest Subgraph. - András Faragó; Zohre R. Mojaveri (Algorithms, 2019)

Job Edge-Fog Interconnection Network Creation Game in Internet of Things. - Rupei Xu; András Faragó; Jason P. Jue (CoRR, 2019)

The Landscape of Minimum Label Cut (Hedge Connectivity) Problem. - Rupei Xu; András Faragó (CoRR, 2019)

Optimization of Virtual Networks. - András Faragó (CoRR, 2020)

A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties. - Zohre Ranjbar-Mojaveri; Andras Farago (CoRR, 2020)

On Non-Markovian Performance Models. - Andras Farago (CoRR, 2020)

A new algorithm design technique for hard problems. - András Faragó; Rupei Xu (Theor. Comput. Sci., 2020)

Decomposition of Random Sequences into Mixtures of Simpler Ones and Its Application in Network Analysis. - András Faragó (Algorithms, 2021)

A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results - A Survey. - András Faragó (Algorithms, 2021)

Safe Approximation - An Efficient Solution for a Hard Routing Problem. - András Faragó; Zohre R. Mojaveri (Algorithms, 2021)

The Impact of Edge Correlations in Random Networks. - András Faragó (Complex Syst., 2021)

Routing Packet Traffic via Enhanced Access Control List for Network Congestion Avoidance. - Zohre Ranjbar-Mojaveri; Andras Farago (CoRR, 2021)

Routing for Global Congestion Avoidance. - Zohre R. Mojaveri; András Faragó (CoRR, 2021)

Almost Uniform Sampling of Independent Sets in Polynomial Time - Implying NP=RP. - Andras Farago (CoRR, 2023)