András Faragó

Orcid: 0000-0001-8952-6946

Affiliations:
  • University of Texas at Dallas, USA


According to our database1, András Faragó authored at least 98 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2021
Routing for Global Congestion Avoidance.
CoRR, 2021

Routing Packet Traffic via Enhanced Access Control List for Network Congestion Avoidance.
CoRR, 2021

The Impact of Edge Correlations in Random Networks.
Complex Syst., 2021

Safe Approximation - An Efficient Solution for a Hard Routing Problem.
Algorithms, 2021

A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results - A Survey.
Algorithms, 2021

Decomposition of Random Sequences into Mixtures of Simpler Ones and Its Application in Network Analysis.
Algorithms, 2021

2020
A new algorithm design technique for hard problems.
Theor. Comput. Sci., 2020

On Non-Markovian Performance Models.
CoRR, 2020

A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties.
CoRR, 2020

Optimization of Virtual Networks.
CoRR, 2020

2019
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem.
CoRR, 2019

Job Edge-Fog Interconnection Network Creation Game in Internet of Things.
CoRR, 2019

In Search of the Densest Subgraph.
Algorithms, 2019

2018
Connectivity and Structure in Large Networks.
CoRR, 2018

Utilizing Network Structure to Bound the Convergence Rate in Markov Chain Monte Carlo Algorithms.
CoRR, 2018

A Simple Approximation for a Hard Routing Problem.
CoRR, 2018

A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

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

Utilizing Network Structure to Accelerate Markov Chain Monte Carlo Algorithms.
Algorithms, 2016

2015
Topology analysis of multi-hop wireless networks.
Proceedings of the 16th IEEE International Conference on High Performance Switching and Routing, 2015

2013
Network reliability analysis with unreliable information.
Proceedings of the 9th International Conference on the Design of Reliable Communication Networks, 2013

2012
Brief announcement: an obstacle to scalability in wireless networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Exploring Structural Properties of Web Graphs through 3D Visualization.
Proceedings of the ICEIS 2012 - Proceedings of the 14th International Conference on Enterprise Information Systems, Volume 2, Wroclaw, Poland, 28 June, 2012

Network analysis under perturbations.
Proceedings of the FOMC'12, 2012

2011
Asymptotically optimal trade-off between local and global connectivity in wireless networks.
Perform. Evaluation, 2011

Low Distortion Metric Embedding into Constant Dimension.
Proceedings of the Theory and Applications of Models of Computation, 2011

Connecting Two Worlds: Physical Models and Graph Models of Wireless Network Topologies.
Proceedings of the 13th IEEE International Conference on High Performance Computing & Communication, 2011

2010
On dual power assignment optimization for biconnectivity.
J. Comb. Optim., 2010

On the Structure of Classes of Random Graphs.
Chic. J. Theor. Comput. Sci., 2010

A Self-Tuning Protocol for Optimal Bandwidth Allocation in Wireless Networks.
Proceedings of the Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2010

2009
Scalability of Node Degrees in Random Wireless Network Topologies.
IEEE J. Sel. Areas Commun., 2009

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

Local vs. Global Scalability in Ad Hoc and Sensor Networks.
Proceedings of the Scalable Information Systems, 4th International ICST Conference, 2009

Analysis of Fundamental Limits for Partial Connectivity in Wireless Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

Increased Connectivity at Lower Cost: The Case for Multi-Radio Nodes in Multi-Hop Wireless Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

Structural Properties of Random Graph Models.
Proceedings of the Theory of Computing 2009, 2009

2008
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity.
Theor. Comput. Sci., 2008

A General Tractable Density Concept for Graphs.
Math. Comput. Sci., 2008

Efficient blocking probability computation of complex traffic flows for network dimensioning.
Comput. Oper. Res., 2008

On the stability of paths, Steiner trees and connected dominating sets in mobile ad hoc networks.
Ad Hoc Networks, 2008

Algorithmic Challenges in Learning Path Metrics from Observed Choices.
Appl. Artif. Intell., 2008

Fault-Tolerant Dual Power Management in Wireless Sensor Networks.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

On Disjoint Connecting Paths and Unsplittable Flow.
Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008

On the Descriptional Complexity of Path Optimization in Graphs.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
On the Fundamental Limits of Topology Control in Ad Hoc Networks.
Algorithmica, 2007

A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges.
Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007

Learning Path Metrics from Observed Choices.
Proceedings of the 2007 International Conference on Machine Learning; Models, 2007

Minimum Frequencies for the Virtual Maximum MAC Capacity in a Multichannel Ad-Hoc Network.
Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 2007

Sampling from Independence Systems.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

Methods for Handling Non-Markovian Performance Models.
Proceedings of the 2007 International Conference on Communications in Computing, 2007

2006
Speeeding Up Markov Chain Monte Carlo Algorithms.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

On the Convergence Rate of Quasi Lumpable Markov Chains.
Proceedings of the Formal Methods and Stochastic Models for Performance Evaluation, 2006

On-line Algorithm for Server Selection of Video Streaming over P2P Networks.
Proceedings of the 2006 International Conference on Communications in Computing, 2006

Towards the Integration of Reliability and Traffic Engineering.
Proceedings of the 2006 International Conference on Communications in Computing, 2006

2005
On the typical case complexity of graph optimization.
Discret. Appl. Math., 2005

On the route refresh frequency for on-demand battery life routing in ad hoc networks.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005

An efficient algorithm for the optimal number of route transitions in mobile ad hoc networks.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005

Video Streaming Over Multi-hop Wireless Networks.
Proceedings of the Seventh IEEE International Symposium on Multimedia (ISM 2005), 2005

Almost Surely Almost Exact Optimization in Random Graphs.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

Finding Dense Subgraphs Efficiently.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

New analytical results on ad hoc network connectivity.
Proceedings of the Third IASTED International Conference on Communications and Computer Networks, 2005

Power sensitive power control in ad networks.
Proceedings of the 43nd Annual Southeast Regional Conference, 2005

2004
Looking at protocol efficiency from a new angle: stability - delay analysis.
Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols, 2004

Availability estimation of routes, trees and subnetworks for end-to-end QoS.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

On the fundamental limits of topology control.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

2003
MERIT: A Scalable Approach for Protocol Assessment.
Mob. Networks Appl., 2003

Inverse Optimization in High-speed Networks.
Discret. Appl. Math., 2003

A Mathematical Method for Analyzing the Effect of Different Protocol Layers on Routing in Ad Hoc Networks.
Proceedings of the International Conference on Wireless Networks, 2003

On incorporating dependent link failures in a traffic engineering model.
Proceedings of IEEE International Conference on Communications, 2003

2002
Network Level Capacity Planning with Efficiently Computable Global Optimum.
Proceedings of the 10th International Workshop on Modeling, 2002

Shared path protection with differentiated reliability.
Proceedings of the IEEE International Conference on Communications, 2002

Scalable analysis and design of ad hoc networks via random graph theory.
Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), 2002

2001
Merit: A unified framework for routing protocol assessment in mobile Ad Hoc networks.
Proceedings of the MOBICOM 2001, 2001

Algorithmic Problems in Power-Controlled Ad Hoc Networks.
Proceedings of the ISCA 14th International Conference on Parallel and Distributed Computing Systems, 2001

2000
Meta-MAC protocols: automatic combination of MAC protocols to optimize performance for unknown conditions.
IEEE J. Sel. Areas Commun., 2000

Blocking Probability Estimation for General Under Incomplete Information.
Proceedings of the 2000 IEEE International Conference on Communications: Global Convergence Through Communications, 2000

A new approach to MAC protocol optimization.
Proceedings of the Global Telecommunications Conference, 2000. GLOBECOM 2000, San Francisco, CA, USA, 27 November, 2000

1999
A new approach to the design and analysis of peer-to-peer mobile networks.
Wirel. Networks, 1999

Virtual Path Network Topology Optimization Using Random Graphs.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Efficient load balancing for UBR traffic in ATM networks.
Proceedings of the 1999 IEEE International Conference on Communications: Global Convergence Through Communications, 1999

1998
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks.
IEEE/ACM Trans. Netw., 1998

Resource assignment for integrated services in wireless ATM networks.
Int. J. Commun. Syst., 1998

1997
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks.
IEEE/ACM Trans. Netw., 1997

Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks.
Simul., 1997

<i>Broadband integrated networks</i>: Mischa Schwartz, Prentice Hall, 1996.
ACM SIGMOBILE Mob. Comput. Commun. Rev., 1997

Analog Neural Optimization for ATM Resource Management.
IEEE J. Sel. Areas Commun., 1997

Optimizing Resource Utilization in Wireless Multimedia Networks.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1996
Lightpath (Wavelength) Routing in Large WDM Networks.
IEEE J. Sel. Areas Commun., 1996

1995
On the complexity of finding sparsest and densest parts in wireless networks.
Wirel. Networks, 1995

A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration.
IEEE J. Sel. Areas Commun., 1995

Enhancing ATM Network Performance by Optimizing the Virtual Network Configuration.
Proceedings of the Data Communications and their Performance, 1995

1994
Optimizing the system of virtual paths.
IEEE/ACM Trans. Netw., 1994

Making transmission schedules immune to topology changes in multi-hop packet radio networks.
IEEE/ACM Trans. Netw., 1994

An Optimal Channel Access Protocol with Multiple Reception Capacity.
IEEE Trans. Computers, 1994

A topology transparent link activation protocol for mobile CDMA radio networks.
IEEE J. Sel. Areas Commun., 1994

1993
Strong universal consistency of neural network classifiers.
IEEE Trans. Inf. Theory, 1993

Fast Nearest-Neighbor Search in Dissimilarity Spaces.
IEEE Trans. Pattern Anal. Mach. Intell., 1993


  Loading...