Mordechai Shalom

Mehmet Aziz Yirik

CoRR, 2024

2023

Defensive domination in proper interval graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., May, 2023

2022

On the maximum cardinality cut problem in proper interval graphs and related graph classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Approximation algorithms for maximum weight k-coverings of graphs by packings.

[BibT_eX]

[DOI]

Fanica Gavril

Discret. Math. Algorithms Appl., 2022

Distribution Games: A New Class of Games With Application to User Provided Networks.

[BibT_eX]

[DOI]

Sinan Emre Tasçi

Ömer Korçak

IEEE Access, 2022

2021

Minimum Reload Cost Graph Factors.

[BibT_eX]

[DOI]

Julien Baste

Dimitrios M. Thilikos

Theory Comput. Syst., 2021

The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation.

[BibT_eX]

[DOI]

Oylum Seker

J. Comb. Optim., 2021

On the Online Coalition Structure Generation Problem.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation.

[BibT_eX]

[DOI]

Algorithms, 2021

Hierarchical b-Matching.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Multicast Communications with Varying Bandwidth Constraints.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020

Parameterized complexity of finding a spanning tree with minimum reload cost diameter.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Networks, 2020

Profit Maximization in Flex-Grid All-Optical Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

2019

Complexity and online algorithms for minimum skyline coloring of intervals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Complexity of edge coloring with minimum reload/changeover costs.

[BibT_eX]

[DOI]

Networks, 2019

On one extension of Dirac's theorem on Hamiltonicity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Maximizing Communication Throughput in Tree Networks.

[BibT_eX]

[DOI]

CoRR, 2019

2018

The maximum cardinality cut problem in co-bipartite chain graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

Equimatchable claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

Online Coalition Structure Generation in Graph Games.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Online Regenerator Placement.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2017

On two extensions of equimatchable graphs.

[BibT_eX]

[DOI]

Zakir Deniz

Tatiana Romina Hartinger

Martin Milanic

Discret. Optim., 2017

2016

Constructing minimum changeover cost arborescenses in bounded treewidth graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Graphs of edge-intersecting and non-splitting paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On Three Extensions of Equimatchable Graphs.

[BibT_eX]

[DOI]

Zakir Deniz

Tatiana Romina Hartinger

Martin Milanic

Electron. Notes Discret. Math., 2016

Equimatchable graphs are C<sub>2k+1</sub>-free for k≥4.

[BibT_eX]

[DOI]

Discret. Math., 2016

On-line maximum matching in complete multi-partite graphs with an application to optical networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

On the complexity of the regenerator location problem treewidth and other parameters.

[BibT_eX]

[DOI]

Itamar Hartstein

Discret. Appl. Math., 2016

Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

A Simple Extension of Dirac's Theorem on Hamiltonicity.

[BibT_eX]

[DOI]

CoRR, 2016

2015

A Graph-Theoretic Approach to Scheduling in Cognitive Radio Networks.

[BibT_eX]

[DOI]

Fatih Alagöz

IEEE/ACM Trans. Netw., 2015

Optimizing busy time on parallel machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the interval chromatic number of proper interval graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

The Maximum Cut Problem in Co-bipartite Chain Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Edge Coloring with Minimum Reload/Changeover Costs.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Equimatchable Graphs are C_2k+1-free for k ≥ 4.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Online optimization of busy time on parallel machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On the complexity of constructing minimum changeover cost arborescences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

On approximating the <i>d</i>-girth of a graph.

[BibT_eX]

[DOI]

David Peleg

Ignasi Sau

Discret. Appl. Math., 2013

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I.

[BibT_eX]

[DOI]

CoRR, 2013

Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012

Placing regenerators in optical networks to satisfy multiple sets of requests.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2012

On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract).

[BibT_eX]

[DOI]

Itamar Hartstein

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Online Optimization of Busy Time on Parallel Machines - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

2011

Optimizing regenerator cost in traffic grooming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2010

Minimizing total busy time in parallel scheduling with application to optical networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Optimal on-line colorings for minimizing the number of ADMs in optical networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms.

[BibT_eX]

[DOI]

Distributed Comput., 2010

Traffic Grooming in Star Networks via Matching Techniques.

[BibT_eX]

[DOI]

Ignasi Sau

Proceedings of the Structural Information and Communication Complexity, 2010

Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Traffic Grooming: Combinatorial Results and Practical Resolutions.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

On minimizing the number of ADMs in a general topology optical network.

[BibT_eX]

[DOI]

Michele Flammini

Discret. Appl. Math., 2009

Shmuel Zaks - The Mathematician, Computer Scientist and Personality.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2009

2008

Approximating the traffic grooming problem in tree and star networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2008

Approximating the traffic grooming problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Selfishness, collusion and power of local search for the ADMs minimization problem.

[BibT_eX]

[DOI]

Comput. Networks, 2008

A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2008

Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2008, 2008

2007

A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2007

Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing.

[BibT_eX]

[DOI]

Michele Flammini

J. Parallel Distributed Comput., 2007

Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem.

[BibT_eX]

[DOI]

Stefania Di Giannantonio

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2007

On the Complexity of the Traffic Grooming Problem in Optical Networks.

[BibT_eX]

[DOI]

Walter Unger

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006

Optimal design problems for optical networks.

[BibT_eX]

[DOI]

PhD thesis, 2006

2005

Minimizing the Number of ADMs in SONET Rings with Maximum Throughput.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

2004

A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings.

[BibT_eX]

[DOI]