Gunes Ercal

According to our database1, Gunes Ercal authored at least 27 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Comparative analysis of course prerequisite networks for five Midwestern public institutions.
Appl. Netw. Sci., December, 2024

2018
Applications of node-based resilience graph theoretic framework to clustering autism spectrum disorders phenotypes.
Appl. Netw. Sci., 2018

Analysis of grapevine gene expression data using node-based resilience clustering.
Proceedings of the 2018 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, 2018

2017
The vertex attack tolerance of complex networks.
RAIRO Oper. Res., 2017

2016
The Quality of Sampling from Geographic Networks.
Int. J. Distributed Sens. Networks, 2016

A Note on the Computational Complexity of Unsmoothened Vertex Attack Tolerance.
CoRR, 2016

Robust Graph-Theoretic Clustering Approaches Using Node-Based Resilience Measures.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015
A comparative analysis of progressive multiple sequence alignment approaches using UPGMA and neighbor joining based guide trees.
CoRR, 2015

A Graph-Theoretic Clustering Methodology Based on Vertex-Attack Tolerance.
Proceedings of the Twenty-Eighth International Florida Artificial Intelligence Research Society Conference, 2015

2014
The Price of Mediation.
Discret. Math. Theor. Comput. Sci., 2014

Comparative Resilience Notions and Vertex Attack Tolerance of Scale-Free Networks.
CoRR, 2014

On Vertex Attack Tolerance in Regular Graphs.
CoRR, 2014

2013
On the Quality of Sampling from Geographic Networks.
Proceedings of the Complex Adaptive Systems 2013 Conference, 2013

Resilience Notions for Scale-free Networks.
Proceedings of the Complex Adaptive Systems 2013 Conference, 2013

2012
Erratum to "More Benefits of Adding Sparse Random Links to Wireless Networks: Yet Another Case for Hybrid Networks".
Int. J. Distributed Sens. Networks, 2012

More Benefits of Adding Sparse Random Links to Wireless Networks: Yet Another Case for Hybrid Networks.
Int. J. Distributed Sens. Networks, 2012

2011
VCG with Communities on Random Ad Hoc Networks.
Int. J. Distributed Sens. Networks, 2011

Small Worlds and Rapid Mixing with a Little More Randomness on Random Geometric Graphs.
Proceedings of the NETWORKING 2011, 2011

User Groups in Social Networks: An Experimental Study on YouTube.
Proceedings of the 44th Hawaii International International Conference on Systems Science (HICSS-44 2011), 2011

2009
Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks.
Algorithms, 2009

On a Local Heuristic for a Reverse Multicast Forwarding Game.
Proceedings of the First International Conference on Networks and Communications, 2009

On a locally minimum cost forwarding game.
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing, 2009

2008
Frugal Routing on Wireless Ad-Hoc Networks.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
On the cover time and mixing time of random geometric graphs.
Theor. Comput. Sci., 2007

2005
On the Cover Time of Random Geometric Graphs.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Bounds on the mixing time and partial cover of ad-hoc and sensor networks.
Proceedings of the Wireless Sensor Networks, Second European Workshop, 2005

2001
On No-Regret Learning, Fictitious Play, and Nash Equilibrium.
Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, Williamstown, MA, USA, June 28, 2001


  Loading...